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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    cin >> n;

    vi A(n);

    for(auto &a: A){
        cin >> a;
    }

    vector<pii> Q;

    int ans = 0;
    for(int i=0; i<2*n; i++){
        int a = A[i%n];
        int c = 1;
        while(!Q.empty()){
            if(!Q.empty() && Q.back().st >= a){
                break;
            }
            int qc = Q.back().nd;
            Q.pop_back();

            c = max(c, qc+1);
        }
        ans = max(ans, c);
        Q.push_back(mp(a, c));
    }

    cout << ans << "\n";

    return 0;
}