140762025-01-09 18:18:47sevenriInverziócpp17Wrong answer 47/50178ms4164 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> s(n + 1);
    for (int i = 1; i <= n; i++) cin >> s[i];
    vector<int> ind(n + 1);
    for (int i = 1; i <= n; i++) ind[s[i]] = i;

    int max = 0, x = 0, l = 0, r = 0;
    for (int i = 2; i <= n; i++){
        if (ind[i - 1] > x) x = ind[i - 1];
        if (x - ind[i] > max){
            max = x - ind[i];
            l = ind[i];
            r = x;
        }
    }
    cout << l << " " << r;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Wrong answer0/11ms520 KiB
4Accepted2/21ms500 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms608 KiB
7Accepted2/2174ms4160 KiB
8Accepted2/2175ms4160 KiB
9Accepted2/2178ms4164 KiB
10Accepted2/2175ms4164 KiB
11Accepted2/2174ms4148 KiB
12Accepted2/2172ms4148 KiB
13Accepted2/2177ms4148 KiB
14Accepted2/2175ms4152 KiB
15Accepted2/2175ms4160 KiB
16Accepted2/2175ms4148 KiB
17Accepted2/2175ms4156 KiB
18Accepted2/2177ms4164 KiB
19Accepted3/3178ms4160 KiB
20Accepted3/3174ms4148 KiB
21Accepted2/2175ms4160 KiB
22Accepted2/2177ms4156 KiB
23Accepted2/2174ms4148 KiB
24Wrong answer0/2175ms4148 KiB