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
38
39
40
#include <bits/stdc++.h>
using namespace std;

vector<int> v, q;

int main() {
	int n;
	scanf("%d", &n);
	
	for (int i=0; i<n; i++) {
		int a;
		scanf("%d", &a);
		v.push_back(a);
	}
	
	for (int i=0; i<n; i++) {
		v.push_back(v[i]);
	}
	
	int res = 0;
	
	while (v.size() != 0) {
		int a = v.back();
		v.pop_back();
		
		while (q.size() != 0) {
			if (a < q.back())
				break;
			q.pop_back();
		}
		
		q.push_back(a);
		
		res = max(res, (int)q.size());
	}
	
	printf("%d\n", res);
	
	return 0;
}