131032025-01-06 14:36:51lacitoInverziócpp17Accepted 50/5068ms4368 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> s(n + 1), pos(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
        pos[s[i]] = i;
    }

    int maxpos = 0, maxdist = 0, maxi = -1, maxj = -1;
    for (int i = 1; i <= n; i++) {
        if (maxpos - pos[i] > maxdist) {
            maxdist = maxpos - pos[i];
            maxi = pos[i];
            maxj = maxpos;
        }
        maxpos = max(maxpos, pos[i]);
    }
    if (maxdist > 0) cout << maxi << " " << maxj << "\n";
    else cout << "-1\n";
    return 0;
}
/*
5
4 3 5 1 2
*/
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/07ms820 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/27ms820 KiB
7Accepted2/264ms4232 KiB
8Accepted2/268ms4148 KiB
9Accepted2/264ms4352 KiB
10Accepted2/268ms4348 KiB
11Accepted2/268ms4356 KiB
12Accepted2/264ms4148 KiB
13Accepted2/264ms4148 KiB
14Accepted2/265ms4148 KiB
15Accepted2/264ms4360 KiB
16Accepted2/268ms4148 KiB
17Accepted2/265ms4148 KiB
18Accepted2/265ms4332 KiB
19Accepted3/364ms4148 KiB
20Accepted3/364ms4160 KiB
21Accepted2/264ms4356 KiB
22Accepted2/264ms4216 KiB
23Accepted2/265ms4152 KiB
24Accepted2/263ms4368 KiB