66 2021. 01. 09 16:26:48 Kevinke12 Inverzió cpp11 Time limit exceeded 46/50 588ms 13948 KiB 
#include <iostream>
#include <vector>
using namespace std;

vector<int> t;
int dp[500005];
int hely[500005];
int N, kezd=-1, veg=-200000, be;

int Melyik(int szam)
{
    for(int i = szam+1; i <= N; i++)
    {
        if(dp[i]!=0)
            return i;
    }
    return szam;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> N;
    for(int i = 0; i < N; i++)
    {
        cin >> be;
        t.push_back(be);
        hely[be]=i;

        dp[t[i]]=t[i]; //onmaga
        dp[t[i]] = dp[Melyik(t[i])];

        if(abs(hely[t[i]]-hely[dp[t[i]]]) > veg-kezd)
        {
            kezd=min(hely[t[i]], hely[dp[t[i]]]);
            veg=max(hely[t[i]], hely[dp[t[i]]]);
        }
    }
    /*for(int i = 1; i <= N; i++)
    {
        if(abs(hely[i]-hely[dp[i]]) > veg-kezd)
        {
            kezd=min(hely[i], hely[dp[i]]);
            veg=max(hely[i], hely[dp[i]]);
        }
    }*/
    if((kezd==-1) || (kezd==veg))
        cout << "-1\n";
    else
        cout << kezd+1 << " " << veg+1 << "\n";
    return 0;
}
Subtask Sum Test Verdict Time Memory
base 46/50
1 Accepted 0/0 1ms 1828 KiB
2 Accepted 0/0 14ms 3216 KiB
3 Accepted 1/1 1ms 1912 KiB
4 Accepted 2/2 1ms 1932 KiB
5 Accepted 7/7 1ms 1936 KiB
6 Accepted 2/2 8ms 3272 KiB
7 Accepted 2/2 495ms 13808 KiB
8 Accepted 2/2 82ms 13808 KiB
9 Accepted 2/2 123ms 13788 KiB
10 Accepted 2/2 116ms 13620 KiB
11 Accepted 2/2 108ms 13764 KiB
12 Accepted 2/2 81ms 13948 KiB
13 Accepted 2/2 85ms 13704 KiB
14 Accepted 2/2 82ms 13732 KiB
15 Accepted 2/2 395ms 13720 KiB
16 Accepted 2/2 90ms 13756 KiB
17 Accepted 2/2 81ms 13864 KiB
18 Accepted 2/2 79ms 13844 KiB
19 Accepted 3/3 382ms 13680 KiB
20 Accepted 3/3 451ms 13812 KiB
21 Time limit exceeded 0/2 513ms 13820 KiB
22 Accepted 2/2 86ms 13740 KiB
23 Accepted 2/2 90ms 13840 KiB
24 Time limit exceeded 0/2 588ms 1044 KiB