138182025-01-08 20:10:31horkaInverziócpp17Accepted 50/50185ms4388 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n; cin>>n;
    vector<int> v(n+1);
    for(int i=1; i<=n; i++)
        cin>>v[i];
    vector<int> pos(n+1);
    for(int i=1; i<=n; i++)
        pos[v[i]]=i;
    int ans=0,l=0,r=0;
    vector<bool> bent(n+2, 1);
    int a=1;
    for(int kis=1; kis<n; kis++)
    {
        int p=pos[kis];
        bent[p]=0;
        while(!bent[a]) a++;
        if(a<p && p-a>r-l)
        {
            r=p,l=a;
        }
    }
    if(l) cout<<l<<" "<<r<<"\n";
    else cout<<"-1\n";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms804 KiB
3Accepted1/11ms508 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms336 KiB
6Accepted2/217ms604 KiB
7Accepted2/2179ms4164 KiB
8Accepted2/2180ms4148 KiB
9Accepted2/2179ms4164 KiB
10Accepted2/2180ms4160 KiB
11Accepted2/2179ms4148 KiB
12Accepted2/2177ms4148 KiB
13Accepted2/2185ms4160 KiB
14Accepted2/2180ms4168 KiB
15Accepted2/2179ms4144 KiB
16Accepted2/2180ms4164 KiB
17Accepted2/2180ms4148 KiB
18Accepted2/2179ms4160 KiB
19Accepted3/3180ms4152 KiB
20Accepted3/3180ms4148 KiB
21Accepted2/2179ms4148 KiB
22Accepted2/2179ms4164 KiB
23Accepted2/2179ms4148 KiB
24Accepted2/2179ms4388 KiB