224542026-01-15 08:40:44mikloshunorInverziócpp17Time limit exceeded 10/50600ms2552 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;
    int kez, veg;
    for (int i = 1; i < n; i++)
    {
        for (int j = n; j > i; j--)
        {
            if  (v[i] > v[j])
            {
                if (j - i > maxi)
                {
                    maxi = j - i;
                    kez = i;
                    veg = j;
                }
            }
        }
    }
    if (maxi == 0)
    {
        cout << -1;
    }
    else
    {
        cout << kez << " " << veg;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0584ms564 KiB
3Accepted1/11ms316 KiB
4Accepted2/23ms316 KiB
5Accepted7/72ms356 KiB
6Time limit exceeded0/2600ms564 KiB
7Time limit exceeded0/2600ms2360 KiB
8Time limit exceeded0/2600ms2356 KiB
9Time limit exceeded0/2583ms2356 KiB
10Time limit exceeded0/2600ms2356 KiB
11Time limit exceeded0/2600ms2356 KiB
12Time limit exceeded0/2597ms2328 KiB
13Time limit exceeded0/2582ms2356 KiB
14Time limit exceeded0/2579ms2368 KiB
15Time limit exceeded0/2580ms2360 KiB
16Time limit exceeded0/2598ms2368 KiB
17Time limit exceeded0/2592ms2356 KiB
18Time limit exceeded0/2583ms2356 KiB
19Time limit exceeded0/3583ms2372 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2592ms2356 KiB
22Time limit exceeded0/2591ms2552 KiB
23Time limit exceeded0/2589ms2356 KiB
24Time limit exceeded0/2600ms2356 KiB