209262026-01-11 14:08:35BikficcInverziócpp17Accepted 50/50182ms2608 KiB
#include <iostream>
#include <vector>
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;
    }

    x=v[1];
    int tav=-1, poz1, poz2;
    for(int i=2; i<n; i++)
    {
        if(x<v[i])
        {
            x=v[i];
        }
        else if(x-v[i]>tav)
        {
            tav=x-v[i];
            poz1=x;
            poz2=v[i];
        }
    }
    if(tav!=-1)
    {
        cout<<poz2<<" "<<poz1;
    }
    else
    {
              cout<<tav;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms568 KiB
3Accepted1/11ms508 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2175ms2356 KiB
8Accepted2/2180ms2356 KiB
9Accepted2/2182ms2364 KiB
10Accepted2/2178ms2356 KiB
11Accepted2/2180ms2356 KiB
12Accepted2/2174ms2100 KiB
13Accepted2/2180ms2368 KiB
14Accepted2/2177ms2364 KiB
15Accepted2/2175ms2564 KiB
16Accepted2/2182ms2360 KiB
17Accepted2/2177ms2548 KiB
18Accepted2/2180ms2364 KiB
19Accepted3/3178ms2356 KiB
20Accepted3/3174ms2356 KiB
21Accepted2/2175ms2356 KiB
22Accepted2/2178ms2356 KiB
23Accepted2/2181ms2608 KiB
24Accepted2/2174ms2356 KiB