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

using namespace std;

const int Limit = 21;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n;
    cin>> n;
     
    // wyszukiwanie w tablicy 2n zamiast rotacji
    vector<int> data(2 * n);
    for (int i = 0; i < n; i++) {
        cin >> data[i];
        data[i + n] = data[i];
    }
    
    vector<int> next(2 * n, 2 * n);
    vector<int> stack; 
    for (int i = 0; i < 2 * n; i++) {
        while (!stack.empty() && data[stack.back()] < data[i]) {
            next[stack.back()] = i;
            stack.pop_back();
        }
        stack.push_back(i);
    }
    
    vector<vector<int>> up(Limit, vector<int>(2 * n + 1, 2 * n));
    
    for (int i = 0; i < 2 * n; i++) {
        up[0][i] = next[i];
    }
    up[0][2 * n] = 2 * n;
    
    for (int k = 1; k < Limit; k++) {
        for (int i = 0; i <= 2 * n; i++) {
            up[k][i] = up[k - 1][up[k - 1][i]];
        }
    }
    
    int best_len = 0;
    for (int i = 0; i < n; i++)
     {

        int curr = i;
        int len = 1; 
        for (int k = Limit - 1; k >= 0; k--) 
        {
            if (up[k][curr] < i + n) {
                curr = up[k][curr];
                len += (1 << k);
            }
        }
        if (len > best_len) {
            best_len = len;
        }
    }
    
    cout << best_len << endl;
    return 0;
}