218142026-01-14 08:21:15KosAKosInverziócpp17Wrong answer 10/50600ms2368 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;j<=n;j++)
            {
                if (tomb[i] > tomb[j] && j-i > nagysag)
                {
                    nagyi = i;
                    nagyj = j;
                    nagysag = j-i+1;
                }
            }
        }

    }
    if (nagysag == 0)
    {
        cout << "-1";
    } else cout << nagyi << " " << nagyj;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Wrong answer0/01ms324 KiB
2Accepted0/0492ms632 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Time limit exceeded0/2593ms564 KiB
7Time limit exceeded0/2600ms2312 KiB
8Time limit exceeded0/2600ms2164 KiB
9Time limit exceeded0/2587ms2356 KiB
10Time limit exceeded0/2580ms2368 KiB
11Time limit exceeded0/2600ms2356 KiB
12Time limit exceeded0/2600ms2100 KiB
13Time limit exceeded0/2578ms2356 KiB
14Time limit exceeded0/2589ms2356 KiB
15Time limit exceeded0/2600ms2328 KiB
16Time limit exceeded0/2600ms2208 KiB
17Time limit exceeded0/2577ms2348 KiB
18Time limit exceeded0/2587ms2180 KiB
19Time limit exceeded0/3600ms2348 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2589ms2356 KiB
22Time limit exceeded0/2587ms2256 KiB
23Time limit exceeded0/2600ms2168 KiB
24Time limit exceeded0/2600ms2356 KiB