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;

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int &x: a) cin >> x;
    for (int i = 0; i < n; i++) {
        a.push_back(a[i]);
    }

    const int K = 22;
    vector dp(K, vector<int>(2*n+1, 2*n));

    stack<int> stk;
    for (int i = 2*n-1; i >= 0; i--) {
        while (!stk.empty() && a[stk.top()] <= a[i]) stk.pop();
        if (!stk.empty()) dp[0][i] = stk.top();
        stk.push(i);
    }

    for (int k = 0; k+1 < K; k++) {
        for (int i = 0; i < 2*n; i++) {
            dp[k+1][i] = dp[k][ dp[k][i] ];
        }
    }

    int res = 0;
    for (int i = 0; i < n; i++) {
        int j = i, cur = 1;
        for (int k = K-1; k >= 0; k--) {
            if (dp[k][j] < i+n) {
                cur += 1 << k;
                j = dp[k][j];
            }
        }
        res = max(res, cur);
    }
    cout << res << '\n';
}