168202025-05-13 17:52:33vargaviviInverziócpp17Time limit exceeded 10/50600ms9628 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, hossz = 0, ans1 = -1, ans2;
    cin >> n;
	vector<pair<int, int>> v(n);
	vector<int> vege(n);
	for (int i = 0; i < n; i ++) {
		vege[i] = i;
		cin >> v[i].first;
		v[i].second = i;
	}
	sort(v.rbegin(), v.rend());
	for (int i = 0; i < n - 1; i ++) {
		if (vege.back() - v[i].second > hossz) {
			hossz = vege.back() - v[i].second;
			ans1 = v[i].second + 1;
			ans2 = vege.back() + 1;
		}
		vege.erase(find(vege.begin(), vege.end(), v[i].second));
	}
	cout << ans1 << " ";
	if (ans1 != -1) cout << ans2;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms500 KiB
2Time limit exceeded0/0584ms1204 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Time limit exceeded0/2600ms1200 KiB
7Time limit exceeded0/2600ms9628 KiB
8Time limit exceeded0/2598ms9492 KiB
9Time limit exceeded0/2587ms9524 KiB
10Time limit exceeded0/2587ms9524 KiB
11Time limit exceeded0/2587ms9492 KiB
12Time limit exceeded0/2598ms9388 KiB
13Time limit exceeded0/2583ms9524 KiB
14Time limit exceeded0/2582ms9524 KiB
15Time limit exceeded0/2582ms9624 KiB
16Time limit exceeded0/2598ms9524 KiB
17Time limit exceeded0/2583ms9524 KiB
18Time limit exceeded0/2582ms9620 KiB
19Time limit exceeded0/3583ms9536 KiB
20Time limit exceeded0/3597ms9524 KiB
21Time limit exceeded0/2592ms9524 KiB
22Time limit exceeded0/2572ms9528 KiB
23Time limit exceeded0/2573ms9492 KiB
24Time limit exceeded0/2598ms9488 KiB