140532025-01-09 17:59:45LazurAndrasInverziócpp17Accepted 50/50189ms4328 KiB
#include <bits/stdc++.h>
#include <iostream>
using namespace std;

int main(){

    int n; cin >> n;
    vector<int>szamok(n+1, 0);
    vector<int>hely(n+1, 0);
    for(int i = 1; i <= n; i++)
    {
        cin >> szamok[i];
        hely[szamok[i]] = i;
    }
    int tav = 0, tav2 = 0, maxi = 0, maxi2 = 0;
    for(int i = 1; i <= n; i++)
    {
        if(i > 1 && tav - hely[i] > maxi2 - maxi)
        {
            maxi = hely[i];
            maxi2 = tav;
        }
        if(hely[i] > tav)
        {
            tav = hely[i];
        }
    }
    if(maxi == 0) cout << "-1";
    else cout << maxi << " " << maxi2;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2177ms4328 KiB
8Accepted2/2189ms4148 KiB
9Accepted2/2189ms4148 KiB
10Accepted2/2181ms4328 KiB
11Accepted2/2182ms4148 KiB
12Accepted2/2179ms4248 KiB
13Accepted2/2182ms4148 KiB
14Accepted2/2181ms4120 KiB
15Accepted2/2178ms4080 KiB
16Accepted2/2182ms4148 KiB
17Accepted2/2181ms4324 KiB
18Accepted2/2181ms4324 KiB
19Accepted3/3180ms4148 KiB
20Accepted3/3178ms4148 KiB
21Accepted2/2175ms4328 KiB
22Accepted2/2185ms4324 KiB
23Accepted2/2181ms4148 KiB
24Accepted2/2175ms4160 KiB