144462025-01-10 20:01:28KateTaylorInverziócpp17Wrong answer 47/50178ms2540 KiB
#include <iostream>
#include <vector>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> best(n, -1);
	int bb = 0, be = 0;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (best[x - 1] != -1) {
			if (i - best[x - 1] > be - bb) {
				bb = best[x - 1]; be = i;
			}
		}
		else {
			for (int j = x - 2; j >= 0; j--) {
				if (best[j] == -1) best[j] = i;
				else break;
			}
		}
	}
	cout << bb + 1 << " " << be + 1;
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base47/50
1Accepted0/01ms316 KiB
2Accepted0/017ms564 KiB
3Wrong answer0/11ms316 KiB
4Accepted2/21ms500 KiB
5Accepted7/71ms316 KiB
6Accepted2/217ms564 KiB
7Accepted2/2174ms2356 KiB
8Accepted2/2178ms2356 KiB
9Accepted2/2178ms2356 KiB
10Accepted2/2175ms2356 KiB
11Accepted2/2174ms2356 KiB
12Accepted2/2172ms2100 KiB
13Accepted2/2177ms2356 KiB
14Accepted2/2174ms2368 KiB
15Accepted2/2175ms2356 KiB
16Accepted2/2175ms2356 KiB
17Accepted2/2174ms2356 KiB
18Accepted2/2174ms2372 KiB
19Accepted3/3174ms2356 KiB
20Accepted3/3174ms2368 KiB
21Accepted2/2174ms2372 KiB
22Accepted2/2175ms2356 KiB
23Accepted2/2175ms2356 KiB
24Wrong answer0/2177ms2540 KiB