140672025-01-09 18:08:26linhnkInverziócpp17Accepted 50/50189ms2380 KiB
#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
     int n, a, maxs=0, mins, h=0, y=0;
     cin>>n;
     vector<int> tav(n+1);
     tav[0]=-1;
     for(int i=1; i<=n; i++){
        cin>>a;
        tav[a]=i;
     }
     for(int i=1; i<=n; i++){
        if(tav[i]>y){
            y=tav[i];
        }
        else if(y-tav[i]>h){
            h=y-tav[i];
            mins=tav[i];
            maxs=y;
        }
     }
     if(h==0){
        cout<<-1;
     }
     else
     cout<<mins<<" "<<maxs;

}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms756 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms328 KiB
5Accepted7/71ms328 KiB
6Accepted2/217ms564 KiB
7Accepted2/2180ms2364 KiB
8Accepted2/2186ms2356 KiB
9Accepted2/2189ms2356 KiB
10Accepted2/2188ms2360 KiB
11Accepted2/2187ms2380 KiB
12Accepted2/2180ms2100 KiB
13Accepted2/2185ms2356 KiB
14Accepted2/2184ms2368 KiB
15Accepted2/2180ms2356 KiB
16Accepted2/2187ms2364 KiB
17Accepted2/2184ms2356 KiB
18Accepted2/2182ms2356 KiB
19Accepted3/3180ms2356 KiB
20Accepted3/3180ms2368 KiB
21Accepted2/2181ms2356 KiB
22Accepted2/2186ms2356 KiB
23Accepted2/2185ms2356 KiB
24Accepted2/2180ms2356 KiB