140382025-01-09 17:49:03Podlipnik07Inverziócpp17Wrong answer 6/5059ms2540 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 maxDiff = -1, maxEnd = -1;
    for (int i : v) {
        if (i == 0) continue;
        else if ((v[1] - i) > maxDiff) {
            maxDiff = (v[1] - i);
            maxEnd = i;
        }
    }
    for (int i : v) {
        if (i == maxEnd) break;
        if (i - maxEnd > maxDiff)maxDiff = (i - maxEnd);
    }
    if (maxEnd == 0) {
        cout << -1; return 0;
    }
    cout << maxEnd << " " << maxDiff + maxEnd;
}

//5
//4 3 5 1 2

// 4 5 2 1 3
SubtaskSumTestVerdictTimeMemory
base6/50
1Accepted0/01ms316 KiB
2Wrong answer0/06ms564 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms316 KiB
6Wrong answer0/26ms656 KiB
7Wrong answer0/256ms2148 KiB
8Wrong answer0/257ms2356 KiB
9Wrong answer0/257ms2360 KiB
10Accepted2/259ms2356 KiB
11Wrong answer0/259ms2356 KiB
12Wrong answer0/256ms2176 KiB
13Wrong answer0/257ms2204 KiB
14Wrong answer0/256ms2356 KiB
15Wrong answer0/256ms2356 KiB
16Wrong answer0/259ms2144 KiB
17Wrong answer0/256ms2256 KiB
18Wrong answer0/256ms2356 KiB
19Wrong answer0/356ms2540 KiB
20Wrong answer0/356ms2356 KiB
21Wrong answer0/254ms2360 KiB
22Wrong answer0/256ms2356 KiB
23Accepted2/257ms2360 KiB
24Wrong answer0/254ms2356 KiB