218122026-01-14 08:16:55KosAKosInverziócpp17Time limit exceeded 10/50600ms2384 KiB
#include <iostream>

using namespace std;

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


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> tomb[i];
    }
    for (int i=1;i<=n;i++)
    {
        if(tomb[i] > tomb[nagyj]) {
            for (int j=i+nagysag+1;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/01ms316 KiB
2Time limit exceeded0/0589ms580 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Time limit exceeded0/2596ms748 KiB
7Time limit exceeded0/2600ms2356 KiB
8Time limit exceeded0/2600ms2384 KiB
9Time limit exceeded0/2586ms2356 KiB
10Time limit exceeded0/2600ms2352 KiB
11Time limit exceeded0/2600ms2132 KiB
12Time limit exceeded0/2600ms2168 KiB
13Time limit exceeded0/2580ms2324 KiB
14Time limit exceeded0/2598ms2148 KiB
15Time limit exceeded0/2600ms2308 KiB
16Time limit exceeded0/2600ms2356 KiB
17Time limit exceeded0/2578ms2264 KiB
18Time limit exceeded0/2600ms2220 KiB
19Time limit exceeded0/3600ms2356 KiB
20Time limit exceeded0/3598ms2264 KiB
21Time limit exceeded0/2575ms2280 KiB
22Time limit exceeded0/2600ms2356 KiB
23Time limit exceeded0/2600ms2316 KiB
24Time limit exceeded0/2600ms2356 KiB