209002026-01-11 01:38:01hunzombiInverziócpp17Wrong answer 5/50177ms2548 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> arr(n + 1, 0);
    for (int i=1; i <= n; i++) {
        cin >> arr[i];
    }
    int low = 1, high = n;
    while (low < high) {
        if (arr[low] > arr[high]) {
            cout << low << ' ' << high << '\n';
            return 0;
        }
        if (arr[low + 1] > arr[high]) {
            cout << low + 1 << ' ' << high << '\n';
            return 0;
        }
        if (arr[low] > arr[high - 1]) {
            cout << low << ' ' << high - 1 << '\n';
            return 0;
        }
        low++; high--;
    }
    cout << -1 << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base5/50
1Accepted0/01ms316 KiB
2Wrong answer0/017ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/22ms316 KiB
5Wrong answer0/71ms316 KiB
6Wrong answer0/217ms756 KiB
7Wrong answer0/2172ms2364 KiB
8Wrong answer0/2172ms2372 KiB
9Wrong answer0/2172ms2136 KiB
10Wrong answer0/2172ms2356 KiB
11Wrong answer0/2172ms2356 KiB
12Wrong answer0/2168ms2100 KiB
13Wrong answer0/2172ms2368 KiB
14Wrong answer0/2172ms2356 KiB
15Wrong answer0/2172ms2356 KiB
16Wrong answer0/2172ms2548 KiB
17Wrong answer0/2172ms2364 KiB
18Wrong answer0/2172ms2356 KiB
19Wrong answer0/3173ms2368 KiB
20Wrong answer0/3172ms2356 KiB
21Wrong answer0/2172ms2356 KiB
22Wrong answer0/2172ms2356 KiB
23Wrong answer0/2177ms2356 KiB
24Accepted2/2172ms2356 KiB