129772025-01-04 12:56:12feheristvanInverziócpp17Wrong answer 1/50178ms2548 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    vector <int> v;
    cin >> n;
    v.resize(n);
    for(int i = 0; i < n; i ++)
        cin >> v[i];
    bool t = 0;
    int k = n, i;
    while(k >= 2 && !t){
        i = 0;
        while(i <= n - k && !t){
            if(v[i] > v[k - i + 1]){
                t = 1;
                cout << i + 1 << " " << k - i + 1;
            }
            i ++;
        }
        k --;
    }
    if(!t)
        cout << "-1";
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base1/50
1Accepted0/01ms320 KiB
2Wrong answer0/017ms760 KiB
3Accepted1/11ms320 KiB
4Wrong answer0/21ms320 KiB
5Wrong answer0/71ms320 KiB
6Wrong answer0/217ms800 KiB
7Wrong answer0/2177ms2368 KiB
8Wrong answer0/2178ms2360 KiB
9Wrong answer0/2177ms2360 KiB
10Wrong answer0/2177ms2360 KiB
11Wrong answer0/2178ms2364 KiB
12Wrong answer0/2173ms2328 KiB
13Wrong answer0/2178ms2360 KiB
14Wrong answer0/2177ms2360 KiB
15Wrong answer0/2177ms2360 KiB
16Wrong answer0/2178ms2548 KiB
17Wrong answer0/2178ms2360 KiB
18Wrong answer0/2177ms2360 KiB
19Wrong answer0/3178ms2376 KiB
20Wrong answer0/3178ms2372 KiB
21Wrong answer0/2178ms2360 KiB
22Wrong answer0/2177ms2360 KiB
23Wrong answer0/2178ms2360 KiB
24Wrong answer0/2177ms2360 KiB