225442026-01-15 10:54:59mikloshunorInverziócpp17Wrong answer 7/50185ms2552 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, kez, veg;
    bool van = false;
    while (i < n && !van)
    {
        j = n;
        while (j > 0 && !van)
        {
            if (v[i] > v[j])
            {
                van = true;
                kez = i;
                veg = j;
            }
            j--;
        }
        i++;
    }
    if (van)
    {
        cout << kez << " " << veg;
    }
    else
    {
        cout << -1;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base7/50
1Accepted0/01ms512 KiB
2Wrong answer0/017ms564 KiB
3Accepted1/11ms500 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms316 KiB
6Wrong answer0/217ms608 KiB
7Wrong answer0/2179ms2372 KiB
8Wrong answer0/2178ms2356 KiB
9Wrong answer0/2179ms2360 KiB
10Accepted2/2178ms2356 KiB
11Wrong answer0/2179ms2356 KiB
12Wrong answer0/2174ms2328 KiB
13Wrong answer0/2179ms2356 KiB
14Wrong answer0/2178ms2356 KiB
15Wrong answer0/2180ms2356 KiB
16Wrong answer0/2179ms2548 KiB
17Wrong answer0/2179ms2356 KiB
18Wrong answer0/2178ms2356 KiB
19Wrong answer0/3180ms2356 KiB
20Wrong answer0/3180ms2364 KiB
21Wrong answer0/2179ms2368 KiB
22Wrong answer0/2179ms2552 KiB
23Accepted2/2179ms2356 KiB
24Wrong answer0/2185ms2356 KiB