254002026-02-19 19:42:57lorantbLegmesszebbi rossz sorrendű (35 pont)cpp17Accepted 35/3537ms1076 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int> nums(n);
	for(int i = 0; i < n; i++) cin >> nums[i];
	vector<int> x(n);
	x[n-1] = nums[n-1];
	for(int i = n-2; i >= 0; i--) x[i] = min(nums[i], x[i+1]);
	int a = -1000000;
	int ans = 0;
	int b = 0;
	int e=-1,f=-1;
	for(int i = 0; i < n-1; i++) {
		if(nums[i] > a) {
			a = nums[i];
			while(b < n && x[b] < nums[i]) b++;
			if(b-i-1 > ans) {
				ans = b-i-1;
				e = i+1; f = b;
			}
		}
	}
	if(e != -1) cout << e <<  " "<< f;
	else cout << -1;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/01ms316 KiB
2Accepted0/037ms1076 KiB
3Accepted1/11ms508 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Accepted1/11ms316 KiB
8Accepted1/11ms316 KiB
9Accepted1/12ms316 KiB
10Accepted1/12ms316 KiB
11Accepted1/12ms508 KiB
12Accepted2/216ms572 KiB
13Accepted2/217ms588 KiB
14Accepted2/218ms648 KiB
15Accepted2/212ms520 KiB
16Accepted2/218ms608 KiB
17Accepted2/226ms940 KiB
18Accepted2/230ms976 KiB
19Accepted2/234ms1012 KiB
20Accepted2/234ms1076 KiB
21Accepted2/237ms1076 KiB
22Accepted2/237ms1060 KiB
23Accepted2/234ms1052 KiB
24Accepted2/234ms1076 KiB