140252025-01-09 17:38:19mateInverziócpp17Wrong answer 47/50182ms2548 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,a; cin >> n;
    vector <int> v(n+1);
    for(int i = 1; i <= n; i++){
        cin >> a;
        v[a] = i;
    }
    int maxi = 0,mini = 0;
    int ans = 0;
    int l=0,r=0;
    for(int i = 1; i <= n; i++){
        maxi = max(maxi,v[i]);
        if(maxi-v[i] > ans){
            ans = maxi - v[i];
            l = maxi;
            r = v[i];
        }
    }
    cout << r << ' ' << l;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms748 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms596 KiB
7Accepted2/2174ms2368 KiB
8Accepted2/2180ms2356 KiB
9Accepted2/2182ms2172 KiB
10Accepted2/2178ms2368 KiB
11Accepted2/2178ms2356 KiB
12Accepted2/2175ms2100 KiB
13Accepted2/2177ms2368 KiB
14Accepted2/2177ms2368 KiB
15Accepted2/2174ms2356 KiB
16Accepted2/2180ms2548 KiB
17Accepted2/2178ms2360 KiB
18Accepted2/2177ms2356 KiB
19Accepted3/3175ms2548 KiB
20Accepted3/3174ms2356 KiB
21Accepted2/2173ms2356 KiB
22Accepted2/2177ms2356 KiB
23Accepted2/2178ms2356 KiB
24Wrong answer0/2172ms2356 KiB