188672025-11-07 16:21:11zsombInverziócpp17Wrong answer 47/50185ms4340 KiB
#include <bits/stdc++.h>
using namespace std;


int main(){
    int n = 0;
    cin >> n;
    vector<int> v(n);
    vector<int> s(n);

    for(int& i : v){
        cin >> i;
        i--;
    }
    
    for(int i = 0; i< n; i++)
        s[v[i]] = i;

    int i = 0,j = 0,b = 0;
    for(int k = 0; k< n; k++){

        if(j-i <= b-s[k] && v[b] < k){
            i = s[k];
            j = b;
        }        

        b = max(b, s[k]);
    }
    if(i == j){
        cout << -1;
    }
    cout << ++i << " " << ++j;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms804 KiB
7Accepted2/2182ms4328 KiB
8Accepted2/2185ms4324 KiB
9Accepted2/2185ms4148 KiB
10Accepted2/2185ms4332 KiB
11Accepted2/2181ms4148 KiB
12Accepted2/2179ms4148 KiB
13Accepted2/2185ms4152 KiB
14Accepted2/2184ms4328 KiB
15Accepted2/2181ms4124 KiB
16Accepted2/2182ms4148 KiB
17Accepted2/2184ms4332 KiB
18Accepted2/2184ms4148 KiB
19Accepted3/3181ms4148 KiB
20Accepted3/3180ms4148 KiB
21Accepted2/2180ms4148 KiB
22Accepted2/2184ms4148 KiB
23Accepted2/2184ms4340 KiB
24Wrong answer0/2180ms4148 KiB