225432026-01-15 10:54:34PappMatyasInverziócpp17Time limit exceeded 36/50600ms2548 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 maxLength = 0;
    int maxi = -1;
    for(int i = 0; i < n - maxLength - 1; i++)
    {
        if(v[i] < maxi)
        {
            continue;
        }
        for(int j = n - 1; j > i; j--)
        {
            if(v[i] > v[j])
            {
                if(j - i > e - b)
                {
                    b = i + 1;
                    e = j + 1;
                    maxLength = e - b;
                    break;
                }

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

SubtaskSumTestVerdictTimeMemory
base36/50
1Accepted0/01ms508 KiB
2Accepted0/034ms564 KiB
3Accepted1/11ms508 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Time limit exceeded0/2600ms2356 KiB
8Accepted2/2187ms2356 KiB
9Accepted2/2192ms2368 KiB
10Accepted2/2189ms2548 KiB
11Accepted2/2193ms2356 KiB
12Accepted2/2188ms2324 KiB
13Accepted2/2197ms2356 KiB
14Accepted2/2193ms2368 KiB
15Time limit exceeded0/2588ms2344 KiB
16Accepted2/2194ms2368 KiB
17Accepted2/2202ms2356 KiB
18Accepted2/2195ms2368 KiB
19Time limit exceeded0/3600ms2156 KiB
20Time limit exceeded0/3600ms2224 KiB
21Time limit exceeded0/2592ms2364 KiB
22Accepted2/2192ms2368 KiB
23Accepted2/2189ms2356 KiB
24Time limit exceeded0/2592ms2356 KiB