225402026-01-15 10:51:08PappMatyasInverziócpp17Time limit exceeded 36/50589ms2552 KiB
#include<iostream>
#include<vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> v(n);

    for(int i = 0; i < n; i++)
    {
        cin >> v[i];
    }

    int b = -1, e = -1;
    int maxi = -1;
    for(int i = 0; i < n; i++)
    {
        if(v[i] < maxi)
        {
            continue;
        }
        for(int j = n - 1; j >= 0; j--)
        {
            if(v[i] > v[j])
            {
                if(j - i > e - b)
                {
                    b = i + 1;
                    e = j + 1;
                    break;
                }

            }
        }
        maxi = max(maxi, v[i]);
    }
    if(e != -1)
    {
        cout << b << " " << e;
    }
    else
    {
        cout << -1;
    }
}

SubtaskSumTestVerdictTimeMemory
base36/50
1Accepted0/01ms316 KiB
2Accepted0/048ms600 KiB
3Accepted1/11ms316 KiB
4Accepted2/22ms316 KiB
5Accepted7/72ms316 KiB
6Accepted2/218ms608 KiB
7Time limit exceeded0/2578ms2356 KiB
8Accepted2/2194ms2368 KiB
9Accepted2/2202ms2368 KiB
10Accepted2/2195ms2368 KiB
11Accepted2/2202ms2368 KiB
12Accepted2/2194ms2332 KiB
13Accepted2/2204ms2372 KiB
14Accepted2/2202ms2376 KiB
15Time limit exceeded0/2561ms2548 KiB
16Accepted2/2200ms2548 KiB
17Accepted2/2211ms2376 KiB
18Accepted2/2204ms2372 KiB
19Time limit exceeded0/3583ms2368 KiB
20Time limit exceeded0/3589ms2552 KiB
21Time limit exceeded0/2580ms2364 KiB
22Accepted2/2207ms2384 KiB
23Accepted2/2201ms2368 KiB
24Time limit exceeded0/2584ms2356 KiB