148112025-02-03 09:30:31KateTaylorLegmesszebbi rossz sorrendű (35 pont)cpp17Accepted 35/3537ms1844 KiB
#include <iostream>
#include <vector>
#include <climits>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> v(200001, INT_MAX);
	int a = -1, b = -1;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (v[x + 100000] != INT_MAX && i - v[x + 100000] > b - a) {
			a = v[x + 100000]; b = i;
		}
		for (int j = x + 99999; j >= 0; j--) {
			if (v[j] != INT_MAX) break;
			v[j] = i;
		}
	}
	if (a == -1) {
		cout << -1;
		return 0;
	}
	cout << a + 1 << " " << b + 1;
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/35
1Accepted0/02ms1076 KiB
2Accepted0/037ms1844 KiB
3Accepted1/12ms1076 KiB
4Accepted1/12ms1268 KiB
5Accepted1/12ms1200 KiB
6Accepted1/12ms1268 KiB
7Accepted1/12ms1076 KiB
8Accepted1/12ms1200 KiB
9Accepted1/12ms1208 KiB
10Accepted1/13ms1184 KiB
11Accepted1/13ms1160 KiB
12Accepted2/216ms1440 KiB
13Accepted2/218ms1504 KiB
14Accepted2/219ms1332 KiB
15Accepted2/212ms1392 KiB
16Accepted2/219ms1312 KiB
17Accepted2/227ms1588 KiB
18Accepted2/229ms1716 KiB
19Accepted2/232ms1692 KiB
20Accepted2/235ms1688 KiB
21Accepted2/237ms1816 KiB
22Accepted2/237ms1696 KiB
23Accepted2/235ms1696 KiB
24Accepted2/234ms1588 KiB