218082026-01-14 08:10:51KosAKosInverziócpp17Time limit exceeded 10/50600ms2356 KiB
#include <iostream>

using namespace std;

int tomb[10000000];
int n;
int nagyi,nagyj,nagysag;


int main()
{
    cin >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> tomb[i];
    }
    for (int i=1;i<=n;i++)
    {
        for (int j=i+nagysag;j<=n;j++)
        {
            if (tomb[i] > tomb[j] && j-i > nagysag)
            {
                nagyi = i;
                nagyj = j;
                nagysag = j-i;
            }
        }
    }
    if (nagysag == 0)
    {
        cout << "-1";
    } else cout << nagyi << " " << nagyj;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms500 KiB
2Time limit exceeded0/0583ms532 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Time limit exceeded0/2600ms428 KiB
7Time limit exceeded0/2600ms2356 KiB
8Time limit exceeded0/2600ms2104 KiB
9Time limit exceeded0/2589ms2356 KiB
10Time limit exceeded0/2600ms2184 KiB
11Time limit exceeded0/2598ms2260 KiB
12Time limit exceeded0/2600ms2100 KiB
13Time limit exceeded0/2586ms2356 KiB
14Time limit exceeded0/2592ms2312 KiB
15Time limit exceeded0/2592ms2108 KiB
16Time limit exceeded0/2600ms2280 KiB
17Time limit exceeded0/2583ms2356 KiB
18Time limit exceeded0/2589ms2100 KiB
19Time limit exceeded0/3591ms2196 KiB
20Time limit exceeded0/3600ms2272 KiB
21Time limit exceeded0/2586ms2164 KiB
22Time limit exceeded0/2600ms2316 KiB
23Time limit exceeded0/2600ms2356 KiB
24Time limit exceeded0/2580ms2132 KiB