140972025-01-09 18:39:10TundeInverziócpp17Time limit exceeded 10/50600ms3220 KiB
#include <iostream>

using namespace std;

int main()
{
    int n, a=-1, b, y=0, l=0;
    cin >> n;
    int s[n], t[n]= {0};
    for(int i=0; i<n; i++)
    {
        cin >> s[i];
        y=0;
        if(s[i]!=n-1)
        {
            for(int j=0; (j<i/2 && 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(l==n-1)
                    break;
            }
        }
    }
    if(a==-1)
        cout << -1;
    else
        cout << a << " " << b;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0583ms564 KiB
3Accepted1/11ms508 KiB
4Accepted2/21ms508 KiB
5Accepted7/72ms508 KiB
6Time limit exceeded0/2600ms568 KiB
7Time limit exceeded0/2600ms2388 KiB
8Time limit exceeded0/2600ms2504 KiB
9Time limit exceeded0/2586ms2616 KiB
10Time limit exceeded0/2600ms3152 KiB
11Time limit exceeded0/2600ms3160 KiB
12Time limit exceeded0/2600ms2668 KiB
13Time limit exceeded0/2574ms2764 KiB
14Time limit exceeded0/2600ms2884 KiB
15Time limit exceeded0/2600ms2356 KiB
16Time limit exceeded0/2600ms3100 KiB
17Time limit exceeded0/2584ms2868 KiB
18Time limit exceeded0/2578ms2900 KiB
19Time limit exceeded0/3578ms2540 KiB
20Time limit exceeded0/3600ms2548 KiB
21Time limit exceeded0/2584ms2376 KiB
22Time limit exceeded0/2586ms2868 KiB
23Time limit exceeded0/2586ms3220 KiB
24Time limit exceeded0/2600ms2356 KiB