138772025-01-09 07:33:06csdavidInverziócpp17Accepted 50/50192ms2356 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, eddigimax=-1, maxhossz=-1, maxx, maxy, x;
    cin >> n;
    int a[n+1];
    for(int i=0; i<n; i++){
        cin >> x;
        a[x]=i;
    }
    eddigimax=a[1];
    for(int i=2; i<=n; i++){
        //cout << "i: " << i << "\na[i]: " << a[i] << "\neddigimax: " << eddigimax;
        //cout << "\nmaxhossz: " << maxhossz << "\n\n";
        if(a[i]>eddigimax){
            eddigimax=a[i];
        }
        else{
            if(eddigimax-a[i]>maxhossz){
                //cout << "i: " << i << "\na[i]: " << a[i] << "\neddigimax: " << eddigimax;
                //cout << "\nmaxhossz: " << maxhossz;
                maxy=eddigimax+1;
                maxx=a[i]+1;
                maxhossz=eddigimax-a[i];
                //cout << "\nmaxx: " << maxx << "\nmaxy: " << maxy << "\n\n";
                //cout << maxx << ' ' << maxy << '\n';
            }
        }
    }
    if(maxhossz==-1){
        cout << -1;
    }
    else{
        cout << maxx << ' ' << maxy;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/016ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms500 KiB
6Accepted2/216ms592 KiB
7Accepted2/2171ms2128 KiB
8Accepted2/2180ms2348 KiB
9Accepted2/2192ms2100 KiB
10Accepted2/2172ms2224 KiB
11Accepted2/2173ms2100 KiB
12Accepted2/2172ms2100 KiB
13Accepted2/2173ms2356 KiB
14Accepted2/2174ms2104 KiB
15Accepted2/2172ms2336 KiB
16Accepted2/2175ms2208 KiB
17Accepted2/2174ms2348 KiB
18Accepted2/2173ms2108 KiB
19Accepted3/3171ms2356 KiB
20Accepted3/3171ms2316 KiB
21Accepted2/2171ms2236 KiB
22Accepted2/2174ms2188 KiB
23Accepted2/2173ms2356 KiB
24Accepted2/2171ms2100 KiB