140122025-01-09 17:24:02piritymarciInverziócpp17Accepted 50/50184ms2540 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);

    for(int i =1; i<n+1; i++){
        int k;
        cin >> k;
        a[k]=i;
    }
    int m = -1;
    int l = 0;
    pair<int, int> solve;
    for(int i =0; i<n; i++){
        if (m-a[i]>l){
            l = m-a[i];
            solve.first=a[i];
            solve.second=m;
        }if (m<a[i]){
            m = a[i];
        }
    }
    if (l==0){
        cout << -1;
    }else{
        cout << solve.first << " " <<  solve.second;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2174ms2368 KiB
8Accepted2/2184ms2356 KiB
9Accepted2/2182ms2356 KiB
10Accepted2/2177ms2356 KiB
11Accepted2/2179ms2356 KiB
12Accepted2/2174ms2100 KiB
13Accepted2/2179ms2368 KiB
14Accepted2/2177ms2364 KiB
15Accepted2/2175ms2364 KiB
16Accepted2/2179ms2356 KiB
17Accepted2/2178ms2372 KiB
18Accepted2/2178ms2356 KiB
19Accepted3/3175ms2356 KiB
20Accepted3/3175ms2368 KiB
21Accepted2/2174ms2368 KiB
22Accepted2/2178ms2356 KiB
23Accepted2/2180ms2356 KiB
24Accepted2/2174ms2540 KiB