218822026-01-14 09:52:42ZsoltInverziócpp17Accepted 50/50185ms2372 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,x;
    cin>>n;
    vector<int>v(n+1);
    for(int i=1; i<=n; i++)
    {
        cin>>x;
        v[x]=i;
    }
    int maxh=-1,k,veg;
    x=v[1];
    for(int i=2; i<=n; i++)
    {
        if(x<v[i])
        {
            x=v[i];
        }
        else
        {
            if(x-v[i]>maxh)
            {
                maxh=x-v[i];
                k=v[i];
                veg=x;
            }
        }
    }
    if(maxh==-1)
    {
        cout<<maxh;
    }
    else
    {
       cout<<k<<" "<<veg;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms520 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2174ms2364 KiB
8Accepted2/2185ms2356 KiB
9Accepted2/2185ms2356 KiB
10Accepted2/2177ms2372 KiB
11Accepted2/2180ms2356 KiB
12Accepted2/2179ms2100 KiB
13Accepted2/2179ms2356 KiB
14Accepted2/2180ms2368 KiB
15Accepted2/2175ms2368 KiB
16Accepted2/2180ms2356 KiB
17Accepted2/2178ms2360 KiB
18Accepted2/2178ms2356 KiB
19Accepted3/3175ms2356 KiB
20Accepted3/3174ms2372 KiB
21Accepted2/2174ms2360 KiB
22Accepted2/2178ms2356 KiB
23Accepted2/2178ms2356 KiB
24Accepted2/2180ms2356 KiB