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
34
35
36
37
#include <bits/stdc++.h>
using namespace std;
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	vector<int> a(2 * n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = n; i < 2 * n; i++) {
		a[i] = a[i-n];
	}
	vector<pair<int,int>> s;
	s.emplace_back(INT_MAX / 2, -1);
	vector<int> pref(2 * n + 1);
	for (int i = 0; i < 2 * n; i++) {
		while (s.back().first < a[i]) {
			s.pop_back();
		}
		if (i >= n) {
			pref[s.back().second + 1]++;
			pref[i+1]--;
		}
		s.emplace_back(a[i], i);
	}
	for (int i = 1; i < (int) pref.size(); i++) {
		pref[i] += pref[i-1];
	}
	int answer = 0;
	for (int i = 0; i < n; i++) {
		answer = max(answer, pref[i] + pref[i+n]);
	}
	cout << answer << endl;
}