129742025-01-04 12:53:53GundischBalazsInverziócpp17Wrong answer 1/50600ms2552 KiB
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector <int> elemek;
    int x;
    elemek.resize(n);
    for(int i=0; i < n; i++){
        cin >> elemek[i];
    }
    int egy=0,ketto=0,hossz=0,j;
    for(int i=0; i < n-1; i++){
        for(int j=n-1; j > i; j--){
            if(elemek[i]>elemek[j]){
                if(j-i > hossz){
                    hossz=j-i;
                    egy=j+1;
                    ketto=i+1;
                }
            }
        }
    }
    if(hossz==0){
        cout << -1;
    }
    else{
        cout << egy << " " << ketto;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base1/50
1Wrong answer0/01ms320 KiB
2Time limit exceeded0/0578ms568 KiB
3Accepted1/11ms500 KiB
4Wrong answer0/24ms320 KiB
5Wrong answer0/72ms320 KiB
6Time limit exceeded0/2600ms568 KiB
7Time limit exceeded0/2600ms2308 KiB
8Time limit exceeded0/2600ms2552 KiB
9Time limit exceeded0/2579ms2360 KiB
10Time limit exceeded0/2600ms2360 KiB
11Time limit exceeded0/2600ms2360 KiB
12Time limit exceeded0/2600ms2104 KiB
13Time limit exceeded0/2587ms2360 KiB
14Time limit exceeded0/2600ms2360 KiB
15Time limit exceeded0/2600ms2360 KiB
16Time limit exceeded0/2600ms2552 KiB
17Time limit exceeded0/2592ms2360 KiB
18Time limit exceeded0/2584ms2540 KiB
19Time limit exceeded0/3584ms2548 KiB
20Time limit exceeded0/3600ms2360 KiB
21Time limit exceeded0/2587ms2360 KiB
22Time limit exceeded0/2600ms2360 KiB
23Time limit exceeded0/2600ms2360 KiB
24Time limit exceeded0/2600ms2360 KiB