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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#define _CRT_SECURE_NO_WARNINGS

#include<cstdio>
#include<stack>
#include<algorithm>

using namespace std;

#define MAXN 1000005

int n;
int A[MAXN];
int B[MAXN];
int prev_greater[MAXN];
int diff[MAXN];

int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &A[i]);
        B[i] = A[i];
        B[i + n] = A[i];
    }

    int N = 2 * n;

    stack<int> st;
    for (int i = 0; i < N; i++) {
        while (!st.empty() && B[st.top()] < B[i]) {
            st.pop();
        }
        if (st.empty()) {
            prev_greater[i] = 0;
        }
        else {
            prev_greater[i] = st.top();
        }
        st.push(i);
    }

    for (int i = 1; i <= N; i++) {
        int L = max(prev_greater[i] + 1, i - n + 1);
        int R = i;

        if (L <= R) {
            diff[L] += 1;
            diff[R + 1] -= 1;
        }
    }

    int cur = 0;
    int ans = 0;

    for (int i = 1; i <= N; i++) {
        cur += diff[i];
        if (i <= n) {
            if (cur > ans) {
                ans = cur;
            }
        }
    }

    printf("%d\n", ans);
    return 0;
}