174682025-07-18 09:55:58KristófInverziócpp17Accepted 50/50187ms5688 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int> index(n+1);
    int tmp;
    for(int i=1;i<=n;i++)
        {
        cin>>tmp;
        index[tmp]=i;
        }
    int ii=-1,ji=-1;
    int max=0;
    for(int i=1;i<=n;i++)
        {
        if(index[i]>max)
            {
            max=index[i];
            }
        else
            {
            if(max-index[i]>ji-ii)
                {
                ji=max;
                ii=index[i];
                }
            }
        }
    if(ii==-1)
        {
        cout<<-1<<endl;
        }
    else
        {
        cout<<ii<<" "<<ji<<endl;
        }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/017ms892 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms320 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms848 KiB
7Accepted2/2177ms5684 KiB
8Accepted2/2184ms5680 KiB
9Accepted2/2186ms5552 KiB
10Accepted2/2182ms5672 KiB
11Accepted2/2180ms5536 KiB
12Accepted2/2179ms5512 KiB
13Accepted2/2181ms5556 KiB
14Accepted2/2180ms5552 KiB
15Accepted2/2179ms5684 KiB
16Accepted2/2187ms5684 KiB
17Accepted2/2184ms5688 KiB
18Accepted2/2180ms5684 KiB
19Accepted3/3179ms5684 KiB
20Accepted3/3178ms5680 KiB
21Accepted2/2180ms5684 KiB
22Accepted2/2185ms5684 KiB
23Accepted2/2187ms5680 KiB
24Accepted2/2175ms5556 KiB