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

using namespace std;
using ll = long long;
#define all(a) begin(a), end(a)

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &i : a) {
        cin >> i;
    }

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

    vector<int> st;
    int res = 0;
    for (auto i : a) {
        while (st.size() && st.back() <= i) {
            st.pop_back();
        }
        st.push_back(i);
        res = max<int>(res, st.size());
    }
    cout << res << "\n";
}

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

    int q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
}