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

using namespace std;

int main () {
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector <int> a(2*n+2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i+n] = a[i];
    }
    vector <int> ile(n+10);
    deque <int> dq;
    for (int i = 1; i <= 2*n; i++) {
        while (!dq.empty() && dq.front() < i-n+1) dq.pop_front();
        while (!dq.empty() && a[dq.back()] < a[i]) dq.pop_back();
        if (i > n) {
            if (!dq.empty()) {
                int j = i-n;
                int najb = dq.back();
                int k = (najb-1)%n+1;
                if (k+1 > j) {
                    ile[n+1]--;
                    ile[1]++;
                }
                ile[k+1]++;
                ile[j+1]--;
            } else {
                ile[1]++;
                ile[n+1]--;
            }
        }
        dq.push_back(i);
    }
    int wyn = 0, tym = 0;
    for (int i = 1; i <= n; i++) {
        tym+=ile[i];
        wyn = max(wyn,tym);
    }
    cout << wyn << "\n";
    return 0;
}