225332026-01-15 10:43:15mikloshunorInverziócpp17Wrong answer 7/50175ms2540 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> v(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
    }
    int i = 1, j = n + 1, kez, veg;
    bool van = false;
    while (i < n && !van)
    {
        j--;
        if (v[i] > v[j])
        {
            kez = i;
            veg = j;
            van = true;
        }
        if (j = i + 1)
        {
            i++;
            j = n;
        }

    }
    if (van)
    {
        cout << kez << " " << veg;
    }
    else
    {
        cout << -1;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base7/50
1Accepted0/01ms508 KiB
2Wrong answer0/017ms748 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms512 KiB
5Wrong answer0/71ms500 KiB
6Wrong answer0/217ms564 KiB
7Wrong answer0/2173ms2356 KiB
8Wrong answer0/2173ms2368 KiB
9Wrong answer0/2172ms2368 KiB
10Wrong answer0/2173ms2364 KiB
11Wrong answer0/2172ms2356 KiB
12Accepted2/2170ms2100 KiB
13Wrong answer0/2175ms2356 KiB
14Wrong answer0/2173ms2264 KiB
15Wrong answer0/2172ms2356 KiB
16Wrong answer0/2173ms2356 KiB
17Wrong answer0/2172ms2144 KiB
18Wrong answer0/2172ms2356 KiB
19Wrong answer0/3172ms2356 KiB
20Wrong answer0/3175ms2540 KiB
21Wrong answer0/2173ms2356 KiB
22Wrong answer0/2173ms2356 KiB
23Wrong answer0/2172ms2356 KiB
24Accepted2/2175ms2364 KiB