140602025-01-09 18:01:59linhnkInverziócpp17Wrong answer 9/50188ms2552 KiB
#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
     int n, a, maxs=0, mins, h=-1;
     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]>maxs){
            maxs=tav[i];
        }
        else if(maxs-tav[i]>h){
            h=maxs-tav[i];
            mins=tav[i];
        }
     }
     if(h==-1){
        cout<<h;
     }
     else
     cout<<mins<<" "<<maxs;

}
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/01ms316 KiB
2Wrong answer0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms328 KiB
6Accepted2/217ms564 KiB
7Wrong answer0/2182ms2356 KiB
8Wrong answer0/2187ms2364 KiB
9Accepted2/2188ms2372 KiB
10Wrong answer0/2184ms2364 KiB
11Wrong answer0/2185ms2356 KiB
12Wrong answer0/2184ms2284 KiB
13Wrong answer0/2184ms2364 KiB
14Wrong answer0/2184ms2372 KiB
15Wrong answer0/2180ms2372 KiB
16Wrong answer0/2187ms2548 KiB
17Wrong answer0/2184ms2364 KiB
18Wrong answer0/2184ms2356 KiB
19Wrong answer0/3186ms2372 KiB
20Wrong answer0/3181ms2356 KiB
21Wrong answer0/2181ms2364 KiB
22Wrong answer0/2184ms2356 KiB
23Wrong answer0/2184ms2552 KiB
24Accepted2/2180ms2548 KiB