134432025-01-08 07:37:14antiInverziócpp17Time limit exceeded 10/50600ms2336 KiB
#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int t[n];
    for(int i=0; i<n; i++){
        cin >> t[i];
    }
    int max_inv = 0;
    int max_i = 0, max_j = 0;
    for(int j=n-1; j>0; j--){
        for(int i=0; i<j; i++){
            if(t[i] > t[j]){
                if(j-i > max_inv){
                    max_inv = j-i;
                    max_i = i+1;
                    max_j = j+1;
                }
            }
        }
    }
    if(max_i == 0 && max_j == 0){
        cout << -1;
    }
    else{
        cout << max_i << " " << max_j;
    }
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0584ms576 KiB
3Accepted1/11ms500 KiB
4Accepted2/24ms316 KiB
5Accepted7/72ms316 KiB
6Time limit exceeded0/2600ms536 KiB
7Time limit exceeded0/2600ms2092 KiB
8Time limit exceeded0/2600ms2136 KiB
9Time limit exceeded0/2577ms2324 KiB
10Time limit exceeded0/2600ms2228 KiB
11Time limit exceeded0/2600ms2096 KiB
12Time limit exceeded0/2600ms2100 KiB
13Time limit exceeded0/2579ms2104 KiB
14Time limit exceeded0/2600ms2100 KiB
15Time limit exceeded0/2600ms2228 KiB
16Time limit exceeded0/2600ms2280 KiB
17Time limit exceeded0/2587ms2100 KiB
18Time limit exceeded0/2600ms2300 KiB
19Time limit exceeded0/3600ms2336 KiB
20Time limit exceeded0/3600ms2324 KiB
21Time limit exceeded0/2587ms2108 KiB
22Time limit exceeded0/2600ms2096 KiB
23Time limit exceeded0/2600ms2104 KiB
24Time limit exceeded0/2600ms2204 KiB