188652025-11-07 16:10:28zsombInverziócpp17Wrong answer 6/50188ms4340 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(b <= j-s[k] && v[j] < k){
            i = s[k];
            b = j-s[k];
        }

        j = max(j, s[k]);
    }
    cout << ++i << " " << ++j;
}
SubtaskSumTestVerdictTimeMemory
base6/50
1Accepted0/01ms500 KiB
2Wrong answer0/017ms564 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms316 KiB
6Accepted2/217ms804 KiB
7Wrong answer0/2184ms4208 KiB
8Wrong answer0/2185ms4328 KiB
9Accepted2/2187ms4328 KiB
10Wrong answer0/2186ms4332 KiB
11Wrong answer0/2186ms4148 KiB
12Wrong answer0/2182ms4244 KiB
13Wrong answer0/2186ms4332 KiB
14Wrong answer0/2185ms4328 KiB
15Wrong answer0/2184ms4148 KiB
16Wrong answer0/2186ms4340 KiB
17Wrong answer0/2186ms4148 KiB
18Wrong answer0/2186ms4324 KiB
19Wrong answer0/3182ms4148 KiB
20Wrong answer0/3185ms4336 KiB
21Wrong answer0/2188ms4148 KiB
22Wrong answer0/2185ms4148 KiB
23Wrong answer0/2186ms4292 KiB
24Wrong answer0/2184ms4324 KiB