129822025-01-04 13:37:10CsongiInverziócpp17Accepted 50/5059ms2560 KiB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

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

    int n, x, i, max = -1, si, sj, sd = -1; cin >> n;
    vector<int> sorozat(n);
    for (i = 0; i < n; i++)
    {
        cin >> x; x--;
        sorozat[x] = i;
    }
    x = 0;
    for (i = 0; i < n; i++)
    {
        if (sorozat[i] > max)
        {
            max = sorozat[i];
        }
        if (max-sorozat[i] > sd)
        {
            sd = max-sorozat[i];
            si = max;
            sj = sorozat[i];
        }
    }
    if (sd<1)
    {
        cout << "-1" << endl;
        return 0;
    }
    else
    {
        cout << sj+1 << " " << si+1 << endl;
    }
    

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms320 KiB
2Accepted0/06ms568 KiB
3Accepted1/11ms500 KiB
4Accepted2/21ms320 KiB
5Accepted7/71ms376 KiB
6Accepted2/26ms568 KiB
7Accepted2/254ms2404 KiB
8Accepted2/257ms2360 KiB
9Accepted2/257ms2360 KiB
10Accepted2/257ms2400 KiB
11Accepted2/259ms2360 KiB
12Accepted2/256ms2272 KiB
13Accepted2/256ms2360 KiB
14Accepted2/256ms2396 KiB
15Accepted2/257ms2360 KiB
16Accepted2/257ms2548 KiB
17Accepted2/257ms2560 KiB
18Accepted2/257ms2360 KiB
19Accepted3/356ms2360 KiB
20Accepted3/356ms2392 KiB
21Accepted2/257ms2360 KiB
22Accepted2/257ms2400 KiB
23Accepted2/259ms2392 KiB
24Accepted2/254ms2360 KiB