184332025-10-22 17:42:55algoproInverziócpp17Accepted 50/50244ms4340 KiB
// UUID: 5d9148d0-fbc3-41a6-beb6-0229275f1ac5
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<pair<int ,int>> nums(n);
	for (int i = 0; i < n; i++) {
		cin >> nums[i].first;
		nums[i].second = i + 1;
	}

	sort(nums.rbegin(), nums.rend());

	int minind = INT_MAX;
	int maxtav = 0;
	int ind;
	int a, b = 0;
	for (int i = 0; i < n; i++) {
		ind = nums[i].second;
		if (minind > ind) {
			minind = ind;
		}
		else {
			if (ind - minind > maxtav) {
				maxtav = ind - minind;
				a = minind;
				b = ind;
			}
		}
	}
	if (b == 0) {
		cout << -1;
	}
	else {
		cout << a << " " << b;
	}
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms536 KiB
2Accepted0/018ms756 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Accepted2/221ms564 KiB
7Accepted2/2204ms4148 KiB
8Accepted2/2240ms4320 KiB
9Accepted2/2244ms4148 KiB
10Accepted2/2239ms4332 KiB
11Accepted2/2241ms4148 KiB
12Accepted2/2236ms4148 KiB
13Accepted2/2238ms4324 KiB
14Accepted2/2237ms4296 KiB
15Accepted2/2199ms4148 KiB
16Accepted2/2239ms4148 KiB
17Accepted2/2238ms4180 KiB
18Accepted2/2238ms4324 KiB
19Accepted3/3202ms4148 KiB
20Accepted3/3201ms4104 KiB
21Accepted2/2201ms4148 KiB
22Accepted2/2238ms4152 KiB
23Accepted2/2238ms4148 KiB
24Accepted2/2189ms4340 KiB