140862025-01-09 18:30:05TundeInverziócpp17Time limit exceeded 12/50600ms3380 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, a=-1, b, y=0, l=0, k=999999999;
    cin >> n;
    int s[n], t[n]={0};
    for(int i=0; i<n; i++)
    {
        cin >> s[i];
        y=0;
        if(s[i]<k)
        {
            
        }
        for(int j=0; j<i-l && y==0; j++)
        {
            if(s[j]>s[i])
            {
                y++;
                t[i]=i-j;
                if(t[i]>l)
                {
                    l=t[i];
                    a=j+1;
                    b=i+1;
                }
            }
        }
    }
    if(a==-1)
        cout << -1;
    else
        cout << a << " " << b;
}
SubtaskSumTestVerdictTimeMemory
base12/50
1Accepted0/01ms500 KiB
2Accepted0/0404ms688 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/2218ms664 KiB
7Time limit exceeded0/2600ms2356 KiB
8Time limit exceeded0/2600ms2504 KiB
9Time limit exceeded0/2579ms3380 KiB
10Time limit exceeded0/2584ms3124 KiB
11Time limit exceeded0/2574ms3124 KiB
12Time limit exceeded0/2600ms2868 KiB
13Time limit exceeded0/2586ms2868 KiB
14Time limit exceeded0/2589ms2864 KiB
15Time limit exceeded0/2579ms2384 KiB
16Time limit exceeded0/2600ms3296 KiB
17Time limit exceeded0/2583ms3028 KiB
18Time limit exceeded0/2578ms2868 KiB
19Time limit exceeded0/3580ms2408 KiB
20Time limit exceeded0/3578ms2548 KiB
21Time limit exceeded0/2600ms2612 KiB
22Time limit exceeded0/2600ms3036 KiB
23Time limit exceeded0/2600ms3372 KiB
24Time limit exceeded0/2600ms2400 KiB