138172025-01-08 20:08:48horkaInverziócpp17Time limit exceeded 26/50601ms27956 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;
    set<int> nagy;
    for(int i=1; i<=n; i++)
        nagy.insert(i);
    for(int kis=1; kis<n; kis++)
    {
        int p=pos[kis];
        nagy.erase(p);
        int a=*nagy.begin();
        if(a<p && p-a>r-l)
        {
            r=p,l=a;
        }
    }
    if(l) cout<<l<<" "<<r<<"\n";
    else cout<<"-1\n";
}
SubtaskSumTestVerdictTimeMemory
base26/50
1Accepted0/01ms316 KiB
2Accepted0/035ms3128 KiB
3Accepted1/11ms500 KiB
4Accepted2/22ms316 KiB
5Accepted7/71ms348 KiB
6Accepted2/246ms2912 KiB
7Accepted2/2460ms27620 KiB
8Time limit exceeded0/2601ms27712 KiB
9Time limit exceeded0/2587ms27724 KiB
10Time limit exceeded0/2601ms27700 KiB
11Time limit exceeded0/2583ms27700 KiB
12Time limit exceeded0/2586ms27164 KiB
13Time limit exceeded0/2582ms27700 KiB
14Time limit exceeded0/2601ms27708 KiB
15Accepted2/2462ms27700 KiB
16Time limit exceeded0/2589ms27712 KiB
17Time limit exceeded0/2601ms27716 KiB
18Time limit exceeded0/2586ms27712 KiB
19Accepted3/3462ms27700 KiB
20Accepted3/3474ms27700 KiB
21Accepted2/2474ms27720 KiB
22Time limit exceeded0/2583ms27700 KiB
23Time limit exceeded0/2579ms27700 KiB
24Accepted2/2423ms27956 KiB