131302025-01-06 17:47:23simon0219Inverziócpp17Time limit exceeded 9/50600ms2552 KiB
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {

int N;
cin>>N;
vector<int>S(N);
for(int i = 0; i <N;i++){
    cin>>S[i];
}
pair<int,int>meg;
int b=0;
for(int i = 0;i<N;i++){
    for(int o = i;o<N;o++){
        if(S[i]>S[o]){
            if(b<(o-i)){
                b=o-i;
                meg.first=i+1;
                meg.second=o+1;
            }
        }
    }
}
cout<<meg.first<<" "<<meg.second;


}
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0583ms564 KiB
3Wrong answer0/11ms500 KiB
4Accepted2/24ms508 KiB
5Accepted7/72ms316 KiB
6Time limit exceeded0/2598ms372 KiB
7Time limit exceeded0/2600ms2356 KiB
8Time limit exceeded0/2600ms2356 KiB
9Time limit exceeded0/2584ms2356 KiB
10Time limit exceeded0/2582ms2356 KiB
11Time limit exceeded0/2583ms2356 KiB
12Time limit exceeded0/2600ms2168 KiB
13Time limit exceeded0/2578ms2540 KiB
14Time limit exceeded0/2600ms2140 KiB
15Time limit exceeded0/2600ms2356 KiB
16Time limit exceeded0/2575ms2356 KiB
17Time limit exceeded0/2586ms2356 KiB
18Time limit exceeded0/2587ms2356 KiB
19Time limit exceeded0/3587ms2360 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2592ms2356 KiB
22Time limit exceeded0/2588ms2356 KiB
23Time limit exceeded0/2587ms2552 KiB
24Time limit exceeded0/2600ms2360 KiB