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

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

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

    vector<int> diff(n + 1, 0);
    stack<int> stk;

    for (int j = 0; j < 2 * n; j++) {
        int bj = a[j % n];
        while (!stk.empty() && a[stk.top() % n] < bj)
            stk.pop();
        int pge = stk.empty() ? -1 : stk.top();
        stk.push(j);

        int lo = max({pge + 1, j - n + 1, 0});
        int hi = min(j, n - 1);
        if (lo <= hi) {
            diff[lo]++;
            diff[hi + 1]--;
        }
    }

    int ans = 0, cur = 0;
    for (int i = 0; i < n; i++) {
        cur += diff[i];
        ans = max(ans, cur);
    }

    cout << ans << "\n";
    return 0;
}