1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
#include<bits/stdc++.h>
using namespace std;
#define int long long

void solve() {
	int n; cin >> n;
	vector<int> a(2 * n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i]; a[i + n] = a[i];
	} deque<int> dq; int ans = 0;
	for(int i = 2 * n; i >= 1; i--) {
		while(!dq.empty() && dq.front() > i + n - 1) dq.pop_front();
		while(!dq.empty() && a[dq.back()] <= a[i]) dq.pop_back();
		dq.push_back(i); ans = max(ans, (int)dq.size());
	} cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	// For Problem with file IO
	// #ifndef CPH
	//   freopen(".in", "r", stdin);
	//   freopen(".out", "w", stdout);
	// #endif
	int t = 1;
	// cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}