131392025-01-06 18:16:36SMC40Inverziócpp17Wrong answer 3/50600ms9600 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin >>n;
    vector<int> v(n+1);
    vector<int> b(n+1);
    for(int i=1;i<=n;i++){
        cin >>v[i];
        b[v[i]]=i;
    }
    int l=b[1];
    int mx=-1;
    for(int i=2;i<=n;i++){
        if(b[i]<l){
            if(l-b[i]>mx){
                mx=b[i];
                cout <<i<<" "<<b[i]<<" "<<l<<" "<<mx<<endl;
            }
        }
        else{
            l=b[i];
        }
    }
    if(mx=-1){
        cout <<mx;
    }
    else{
        cout<<mx<<" "<<l;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base3/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/019ms820 KiB
3Accepted1/11ms508 KiB
4Wrong answer0/22ms316 KiB
5Wrong answer0/72ms316 KiB
6Wrong answer0/243ms904 KiB
7Wrong answer0/2273ms5608 KiB
8Time limit exceeded0/2600ms9448 KiB
9Time limit exceeded0/2600ms9600 KiB
10Wrong answer0/2384ms6884 KiB
11Wrong answer0/2363ms6892 KiB
12Wrong answer0/2375ms6708 KiB
13Wrong answer0/2439ms7472 KiB
14Wrong answer0/2437ms7476 KiB
15Wrong answer0/2266ms5428 KiB
16Wrong answer0/2442ms7732 KiB
17Time limit exceeded0/2514ms8756 KiB
18Wrong answer0/2444ms7476 KiB
19Wrong answer0/3195ms4404 KiB
20Wrong answer0/3284ms5684 KiB
21Wrong answer0/2234ms4916 KiB
22Wrong answer0/2317ms5940 KiB
23Wrong answer0/2402ms7144 KiB
24Accepted2/2181ms4148 KiB