142462025-01-10 10:31:25ruffbrigiInverziócpp17Accepted 50/50184ms2380 KiB
#include <iostream>

using namespace std;

int main()
{
    int n,y;
    cin>>n;
    int a[n+1];
    for(int i=1;i<=n;i++)
    {
        cin>>y;
        a[y]=i;
    }
    int maxh=0,kezd,veg,x=1,h;
    for(int i=2;i<=n;i++)
    {
        if(a[i]<a[x])
        {
            h=a[x]-a[i];
            if(h>maxh)
            {
                maxh=h;
                kezd=x;
                veg=i;
            }
        }
        else
        {
            x=i;
        }

    }

    if(maxh==0)
    {
        cout<<"-1";
    }
    else
    {
        cout<<a[veg]<<" "<<a[kezd];
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/017ms560 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms400 KiB
6Accepted2/217ms588 KiB
7Accepted2/2178ms2264 KiB
8Accepted2/2180ms2348 KiB
9Accepted2/2184ms2352 KiB
10Accepted2/2177ms2220 KiB
11Accepted2/2177ms2208 KiB
12Accepted2/2173ms2380 KiB
13Accepted2/2180ms2160 KiB
14Accepted2/2178ms2356 KiB
15Accepted2/2175ms2292 KiB
16Accepted2/2178ms2204 KiB
17Accepted2/2180ms2112 KiB
18Accepted2/2178ms2100 KiB
19Accepted3/3175ms2156 KiB
20Accepted3/3174ms2356 KiB
21Accepted2/2174ms2252 KiB
22Accepted2/2177ms2196 KiB
23Accepted2/2180ms2100 KiB
24Accepted2/2182ms2280 KiB