131362025-01-06 18:11:51szellandInverziócpp17Accepted 50/50187ms4340 KiB
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> sor (n);
    vector<int> szsor (n);
    for (int i = 0; i < n; i++) {
        cin >> sor[i];
        szsor[sor[i] - 1] = i;
    }
    int maxind = 0;
    int ind_1 = 0;
    int ind_2 = 0;
    int tav = 0;
    for (int i = 1; i < n; i++) {
        maxind = max(maxind, szsor[i - 1]);
        //cout << maxind << " " << szsor[i] << "\n";
        if (maxind - szsor[i] > tav) {
            ind_1 = szsor[i];
            ind_2 = maxind;
            tav = maxind - szsor[i];
            //cout << tav << " " << ind_1 << " " << ind_2 << "\n";
        }
    }
    if (tav > 0) {
        cout << ind_1 + 1 << " " << ind_2 + 1;
    } else {
        cout << "-1";
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms800 KiB
7Accepted2/2177ms4148 KiB
8Accepted2/2185ms4148 KiB
9Accepted2/2187ms4340 KiB
10Accepted2/2180ms4332 KiB
11Accepted2/2184ms4148 KiB
12Accepted2/2182ms4248 KiB
13Accepted2/2184ms4160 KiB
14Accepted2/2184ms4148 KiB
15Accepted2/2175ms4148 KiB
16Accepted2/2184ms4332 KiB
17Accepted2/2182ms4148 KiB
18Accepted2/2181ms4148 KiB
19Accepted3/3175ms4148 KiB
20Accepted3/3177ms4148 KiB
21Accepted2/2178ms4328 KiB
22Accepted2/2180ms4148 KiB
23Accepted2/2180ms4152 KiB
24Accepted2/2175ms4340 KiB