224982026-01-15 09:52:00mikloshunorInverziócpp17Wrong answer 6/50600ms2372 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 maxi = 0;
    bool van = false;
    int kez, veg;
    int x = 1;
    do
    {
        for (int i = n; i > x; i--)
        {
            if (v[x] > v[i])
            {
                if (i - x > maxi)
                {
                    maxi = i - x;
                    kez = x;
                    veg = i;
                    van = true;
                }
            }
        }
        x++;
    }
    while (!van);
    if (van)
    {
        cout << kez << " " << veg;
    }
    else
    {
        cout << -1;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base6/50
1Accepted0/01ms316 KiB
2Wrong answer0/017ms760 KiB
3Time limit exceeded0/1580ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/71ms316 KiB
6Wrong answer0/217ms564 KiB
7Wrong answer0/2180ms2364 KiB
8Wrong answer0/2180ms2356 KiB
9Wrong answer0/2180ms2372 KiB
10Accepted2/2184ms2368 KiB
11Wrong answer0/2180ms2356 KiB
12Wrong answer0/2177ms2344 KiB
13Wrong answer0/2181ms2356 KiB
14Wrong answer0/2186ms2356 KiB
15Wrong answer0/2185ms2356 KiB
16Wrong answer0/2181ms2356 KiB
17Wrong answer0/2181ms2356 KiB
18Wrong answer0/2180ms2360 KiB
19Wrong answer0/3180ms2356 KiB
20Wrong answer0/3180ms2356 KiB
21Wrong answer0/2180ms2368 KiB
22Wrong answer0/2180ms2364 KiB
23Accepted2/2180ms2356 KiB
24Time limit exceeded0/2600ms2356 KiB