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
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <vector>

using namespace std;

typedef long long ll;

int A[2000010];
int P[2000010];

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(NULL);

    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> A[i];
        A[i + n] = A[i];
    }
    int mx = 1, mp = 0;
    for (int i = 0; i < n; i++) {
        if (A[i] > mx) {
            mx = A[i];
            mp = i;
        }
    }
    int res = 0;
    P[0] = A[mp];
    int top = 0;
    for (int i = n - 1; i >= 0; i--) {
        while (top >= 0 && P[top] <= A[mp + 1 + i]) {
            top--;
        }
        P[++top] = A[mp + 1 + i];
        res = max(res, top + 1);
    }

    cout << res << endl;
    cout.flush();

    return 0;
}