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

using namespace std;

void add_range(int l, int r, int n, vector<int>& diff) {
    int sl = l % n;
    int sr = r % n;
    if (sl <= sr) {
        diff[sl]++;
        diff[sr + 1]--;
    } else {
        diff[sl]++;
        diff[n]--;
        diff[0]++;
        diff[sr + 1]--;
    }
}

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

    int n;
    if (!(cin >> n)) return 0;

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

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

    vector<int> L(2 * n);
    stack<int> s;
    for (int i = 0; i < 2 * n; i++) {
        while (!s.empty() && b[s.top()] < b[i]) {
            s.pop();
        }
        if (s.empty()) {
            L[i] = -1;
        } else {
            L[i] = s.top();
        }
        s.push(i);
    }

    vector<int> diff(n + 1, 0);
    for (int i = n; i < 2 * n; i++) {
        int start_pos = max(L[i] + 1, i - n + 1);
        int end_pos = i;
        if (start_pos <= end_pos) {
            add_range(start_pos, end_pos, n, diff);
        }
    }

    int max_delight = 0;
    int current_delight = 0;
    for (int i = 0; i < n; i++) {
        current_delight += diff[i];
        if (current_delight > max_delight) {
            max_delight = current_delight;
        }
    }

    cout << max_delight << endl;

    return 0;
}