131432025-01-06 18:26:37SMC40Inverziócpp17Accepted 50/50199ms4340 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin >>n;
    vector<int> v(n+1);
    vector<int> b(n+1);
    for(int i=1;i<=n;i++){
        cin >>v[i];
        b[v[i]]=i;
    }
    int l=b[1];
    int m=l;
    int t=0;
    int mx=0;
    for(int i=2;i<=n;i++){
        if(b[i]<l){
            if(l-b[i]>mx){
                t=b[i];
                mx=l-b[i];
                m=l;
                //cout << i << " " << t<< " "<<m<< " "<<mx<<endl;
            }
        }
        else{
            l=b[i];
        }
    }
    if(t==0){
        cout <<-1;
    }
    else{
        cout<<t<<" "<<m<<endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms328 KiB
6Accepted2/217ms804 KiB
7Accepted2/2182ms4340 KiB
8Accepted2/2187ms4332 KiB
9Accepted2/2194ms4148 KiB
10Accepted2/2181ms4148 KiB
11Accepted2/2187ms4152 KiB
12Accepted2/2181ms4248 KiB
13Accepted2/2182ms4148 KiB
14Accepted2/2186ms4148 KiB
15Accepted2/2181ms4232 KiB
16Accepted2/2190ms4228 KiB
17Accepted2/2199ms4148 KiB
18Accepted2/2182ms4328 KiB
19Accepted3/3180ms4324 KiB
20Accepted3/3180ms4336 KiB
21Accepted2/2180ms4128 KiB
22Accepted2/2182ms4148 KiB
23Accepted2/2184ms4336 KiB
24Accepted2/2179ms4148 KiB