196102025-12-17 09:35:42SzeredaiNatanaelInverziócpp17Time limit exceeded 10/50600ms2360 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n, maxi = 0; cin >> n;
	vector<int> v(n + 1);
	pair<int, int> t;
	for (int i = 1; i <= n; ++i) cin >> v[i];
	for (int i = 1; i < n; ++i) {
		for (int j = i + 1; j <= n; ++j) {
			if (v[i] > v[j] && j - i > maxi) {
				maxi = j - i;
				t.first = i; t.second = j;
			}
		}
	}
	if (maxi > 0)cout << t.first << " " << t.second << "\n";
	else cout << "-1\n";
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms316 KiB
2Time limit exceeded0/0579ms764 KiB
3Accepted1/11ms508 KiB
4Accepted2/23ms316 KiB
5Accepted7/72ms404 KiB
6Time limit exceeded0/2600ms756 KiB
7Time limit exceeded0/2598ms2356 KiB
8Time limit exceeded0/2600ms2360 KiB
9Time limit exceeded0/2588ms2356 KiB
10Time limit exceeded0/2583ms2360 KiB
11Time limit exceeded0/2583ms2184 KiB
12Time limit exceeded0/2600ms2100 KiB
13Time limit exceeded0/2588ms2356 KiB
14Time limit exceeded0/2587ms2356 KiB
15Time limit exceeded0/2587ms2356 KiB
16Time limit exceeded0/2600ms2140 KiB
17Time limit exceeded0/2586ms2356 KiB
18Time limit exceeded0/2587ms2356 KiB
19Time limit exceeded0/3587ms2356 KiB
20Time limit exceeded0/3600ms2356 KiB
21Time limit exceeded0/2586ms2356 KiB
22Time limit exceeded0/2583ms2356 KiB
23Time limit exceeded0/2583ms2356 KiB
24Time limit exceeded0/2600ms2356 KiB