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

using namespace std;

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

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

    vector<int> a(n);
    int max_val = -1;
    int max_idx = -1;

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

    vector<int> b(n);
    for (int i = 0; i < n; ++i) {
        b[i] = a[(max_idx + 1 + i) % n];
    }

    vector<int> dp(n, 0);
    vector<int> stack;
    int max_zachwytow = 0;

    for (int i = n - 1; i >= 0; --i) {
        while (!stack.empty() && b[stack.back()] <= b[i]) {
            stack.pop_back();
        }

        if (stack.empty()) {
            dp[i] = 1;
        } else {
            dp[i] = 1 + dp[stack.back()];
        }
        
        stack.push_back(i);
        max_zachwytow = max(max_zachwytow, dp[i]);
    }

    cout << max_zachwytow << "\n";

    return 0;
}