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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#pragma GCC optimize("O3")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> oset;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }

template <typename T, typename... V>
void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }

#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif

const ll mod = 1e9+7;
const ll infi  = 1e18+1;
const ld eps = 1e-14L;

const int BIT = 22;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n; cin >> n;
    vector<int> a(2*n);
    for(int i=0;i<n;i++){
        cin >> a[i];
        a[i+n] = a[i];
    }

    vector<vector<int>> jmp(BIT+1, vector<int>(2*n, 2*n-1));
    stack<pair<int,int>> s;
    for(int i=2*n-1;i>=0;i--){
        while(!s.empty() && s.top().first <= a[i]) s.pop();
        jmp[0][i] = (s.empty() ? 2*n-1 : s.top().second);
        s.push({a[i], i});
    }
    debug(jmp[0]);
    for(int j=1;j<=BIT;j++){
        for(int i=2*n-1;i>=0;i--){
            jmp[j][i] = jmp[j-1][jmp[j-1][i]];
        }
    }
    int ans = 0;
    for(int i=0;i<n;i++){
        int lim = i+n-1, res = 0;
        int v = i;
        for(int j=BIT;j>=0;j--){
            debug(v, j, jmp[j][v])
            if(jmp[j][v] <= lim){
                res += (1<<j);
                v = jmp[j][v];
            }
        }
        ans = max(ans, res);
    }
    cout << ans+1 << '\n';
    return 0;
}