140822025-01-09 18:23:18KisbivalyInverziócpp17Wrong answer 47/50193ms2372 KiB
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> a(n+1);
    for (int i= 1; i<n+1; i++) {
        int h;
        cin >> h;
        a[h] = i;
    }
    int tav=0,tav2= 0, nagy=0, nagy2=0;
    for(int i = 1; i <n+1; i++) {
        if (i>1 && tav-a[i]>nagy2-nagy) {
            nagy =a[i];
            nagy2 = tav;
        }
        if (a[i] > tav) {
            tav = a[i];
        }
    }
    if (nagy== 0) cout<< '-1';
    else cout << nagy << ' ' << nagy2;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms756 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2181ms2356 KiB
8Accepted2/2187ms2356 KiB
9Accepted2/2187ms2356 KiB
10Accepted2/2184ms2356 KiB
11Accepted2/2193ms2356 KiB
12Accepted2/2184ms2328 KiB
13Accepted2/2185ms2356 KiB
14Accepted2/2184ms2364 KiB
15Accepted2/2184ms2368 KiB
16Accepted2/2187ms2368 KiB
17Accepted2/2186ms2372 KiB
18Accepted2/2187ms2356 KiB
19Accepted3/3181ms2124 KiB
20Accepted3/3182ms2368 KiB
21Accepted2/2189ms2188 KiB
22Accepted2/2187ms2356 KiB
23Accepted2/2187ms2356 KiB
24Wrong answer0/2181ms2148 KiB