131222025-01-06 17:04:48MagyarKendeSZLGInverziócpp17Accepted 50/50256ms4320 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<array<int, 2>> a(N);
    for (int i = 0; i < N; i++) {
        cin >> a[i][0];
        a[i][1] = i;
    }
    sort(a.begin(), a.end());
    int mx_j = -1, result_i = 1e9, result_j = -1;
    for (auto [x, i] : a) {
        if (result_j - result_i < mx_j - i) {
            result_j = mx_j;
            result_i = i;
        }
        mx_j = max(mx_j, i);
    }
    if (result_j - result_i > 0) {
        cout << result_i + 1 << " " << result_j + 1 << "\n";
    } else {
        cout << "-1\n";
    }
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/019ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/223ms564 KiB
7Accepted2/2211ms4320 KiB
8Accepted2/2254ms4296 KiB
9Accepted2/2256ms4204 KiB
10Accepted2/2250ms4320 KiB
11Accepted2/2252ms4148 KiB
12Accepted2/2246ms4148 KiB
13Accepted2/2250ms4148 KiB
14Accepted2/2250ms4152 KiB
15Accepted2/2210ms4148 KiB
16Accepted2/2252ms4148 KiB
17Accepted2/2250ms4148 KiB
18Accepted2/2252ms4160 KiB
19Accepted3/3211ms4148 KiB
20Accepted3/3212ms4148 KiB
21Accepted2/2209ms4320 KiB
22Accepted2/2252ms4148 KiB
23Accepted2/2252ms4204 KiB
24Accepted2/2210ms4148 KiB