234482026-01-23 08:55:11matemakaiVölgy (100 pont)cpp17Wrong answer 25/10039ms1076 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
	}

	stack<int> s;

	int ans = -1;

	for (int i = 0; i < n; ++i) {
		while (!s.empty() && v[s.top()] <= v[i]) {
			s.pop();
		}
		if (!s.empty() && (i - s.top() + 1) >= 2) {
			ans = max(ans, i - s.top() + 1);
		}
		s.push(i);
	}

	cout << ans << endl;
}
SubtaskSumTestVerdictTimeMemory
base25/100
1Accepted0/01ms500 KiB
2Wrong answer0/01ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Wrong answer0/51ms316 KiB
6Wrong answer0/51ms316 KiB
7Accepted5/51ms316 KiB
8Wrong answer0/51ms400 KiB
9Wrong answer0/52ms316 KiB
10Wrong answer0/52ms500 KiB
11Wrong answer0/53ms316 KiB
12Wrong answer0/53ms316 KiB
13Wrong answer0/54ms316 KiB
14Wrong answer0/54ms444 KiB
15Wrong answer0/532ms800 KiB
16Wrong answer0/535ms800 KiB
17Wrong answer0/535ms1076 KiB
18Accepted5/535ms812 KiB
19Wrong answer0/535ms820 KiB
20Wrong answer0/539ms808 KiB
21Wrong answer0/539ms892 KiB
22Accepted5/539ms988 KiB