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
#include <bits/stdc++.h>
using namespace std;

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

    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i) { 
        cin >> a[i];
    }

    for(int i = 0; i < n - 1; i++) {
        a.push_back(a[i]);
    }

    int sz = (int)a.size();
    vector<int> stos;
    vector<int> pos(sz);

    for(int i = 0; i < sz; ++i) {
        while(true) {
            if(stos.empty()) {
                break;
            }
            int cur = stos.back();
            if(a[cur] < a[i]) {
                stos.pop_back();
            }
            else {
                break;
            }
        }

        int bigger = -1;
        if(!stos.empty()) {
            bigger = stos.back();
        }

        pos[i] = bigger;
        stos.push_back(i);
    }

    vector<int> amnt(sz);
    int cur_ans = 0;
    for(int i = 0; i < n; ++i) {
        if(pos[i] == -1) { 
            cur_ans++;
            continue;
        }
        amnt[pos[i]]++;
    }

    int ans = cur_ans;
    cur_ans--;
    cur_ans += amnt[0];

    for(int i = 1; i < n; ++i) { 
        int j = i + n - 1;
        if(pos[j] == -1 || pos[j] < i){ 
            cur_ans++;
        }
        else {
            amnt[pos[j]]++;
        }

        ans = max(ans, cur_ans);

        cur_ans--;
        cur_ans += amnt[i];
    }
    cout << ans << '\n';
}