140582025-01-09 18:01:52Podlipnik07Inverziócpp17Accepted 50/5065ms2548 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    vector<int> v(n+1);
    for (int i = 0; i < n; i++) {
        int temp; cin >> temp;
        v[temp] = i + 1;
    }
    int diff = -1, maxEnd = -1;
    int maxDiff = -1;
    for (int i : v) {
        if (i == 0) continue;
        else if (i > maxEnd) {
            maxEnd = i;
        }
        else {
            int temp = maxEnd - i;
            if (diff < temp) {
                diff = temp;
                maxDiff = maxEnd;
            }
        }
    }
    if (maxDiff == -1) {
        cout << -1; return 0;
    }
    cout << maxDiff - diff << " " << maxDiff;
}

//5
//4 3 5 1 2

// 4 5 2 1 3
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/07ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms500 KiB
5Accepted7/71ms500 KiB
6Accepted2/27ms564 KiB
7Accepted2/261ms2332 KiB
8Accepted2/264ms2360 KiB
9Accepted2/264ms2356 KiB
10Accepted2/265ms2356 KiB
11Accepted2/263ms2356 KiB
12Accepted2/261ms2100 KiB
13Accepted2/263ms2356 KiB
14Accepted2/261ms2360 KiB
15Accepted2/261ms2356 KiB
16Accepted2/264ms2356 KiB
17Accepted2/261ms2356 KiB
18Accepted2/263ms2360 KiB
19Accepted3/361ms2360 KiB
20Accepted3/361ms2356 KiB
21Accepted2/261ms2356 KiB
22Accepted2/263ms2548 KiB
23Accepted2/263ms2356 KiB
24Accepted2/261ms2356 KiB