209252026-01-11 14:07:02BikficcInverziócpp17Wrong answer 48/50197ms2368 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n, x;
    cin >> n;
    vector<int> v(n+1);
    for(int i=0; i<n; i++)
    {
        cin >> x;
        v[x]=i;
    }

    x=v[1];
    int tav=-1, poz1, poz2;
    for(int i=1; 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+1<<" "<<poz1+1;
    }
    else
    {
              cout<<tav;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base48/50
1Accepted0/01ms316 KiB
2Accepted0/017ms740 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2184ms2368 KiB
8Accepted2/2194ms2356 KiB
9Accepted2/2197ms2356 KiB
10Accepted2/2185ms2356 KiB
11Accepted2/2186ms2368 KiB
12Accepted2/2194ms2328 KiB
13Accepted2/2190ms2356 KiB
14Accepted2/2190ms2356 KiB
15Accepted2/2184ms2356 KiB
16Accepted2/2188ms2356 KiB
17Accepted2/2184ms2356 KiB
18Accepted2/2184ms2356 KiB
19Accepted3/3180ms2304 KiB
20Accepted3/3182ms2356 KiB
21Accepted2/2182ms2356 KiB
22Accepted2/2184ms2368 KiB
23Accepted2/2187ms2364 KiB
24Wrong answer0/2181ms2364 KiB