230082026-01-16 10:36:49PappMatyasInverziócpp17Accepted 50/5067ms2548 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    int begs = -1;
    int ends = -1;
    for(int i = 1; i < n; i++)
    {
        if(x < v[i])
        {
            x = v[i];
        }
        else
        {
            if(x - v[i] > ends - begs)
            {
                begs = v[i];
                ends = x;
            }
        }
    }
    if(begs == -1)
    {
        cout << -1;
    }
    else
    {
        cout << begs + 1 << " " << ends + 1;
    }
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/06ms756 KiB
3Accepted1/11ms500 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/26ms564 KiB
7Accepted2/261ms2356 KiB
8Accepted2/264ms2356 KiB
9Accepted2/263ms2356 KiB
10Accepted2/263ms2356 KiB
11Accepted2/263ms2364 KiB
12Accepted2/263ms2100 KiB
13Accepted2/264ms2356 KiB
14Accepted2/263ms2356 KiB
15Accepted2/261ms2356 KiB
16Accepted2/267ms2356 KiB
17Accepted2/261ms2356 KiB
18Accepted2/264ms2356 KiB
19Accepted3/359ms2548 KiB
20Accepted3/361ms2356 KiB
21Accepted2/259ms2356 KiB
22Accepted2/261ms2360 KiB
23Accepted2/264ms2356 KiB
24Accepted2/259ms2220 KiB