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

typedef long long ll;

#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) int(a.size())
#define f(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) f(i, 0, a)
#define int ll
#define tv(a, x) for (auto& a : x)
#define DUZO 1000000000000000000LL
#define en "\n"
#define cn continue
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vii = vector<pii>;

void solve() {
    int n;
    cin >> n;
    vi a(n);
    f(i, 0, n) cin >> a[i];
    set<int> wyg; //wygrywajace ind
    int maks = 0;
    int ans = 0;
    f(i, 0, n) {
        if (maks < a[i]) {
            wyg.insert(i);
            maks=a[i];
        }
    }
    ans = sz(wyg);
    for (int i = n - 1; i; i--) {
        if (*prev(wyg.end()) == i) wyg.erase(prev(wyg.end()));
        while (sz(wyg) && (a[(*wyg.begin() + n)%n] <= a[i])) {
            wyg.erase(wyg.begin());
        }
        wyg.insert(i - n);
        ans = max(ans, sz(wyg));
    }
    cout << ans << en;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int q = 1;
    //cin >> q;
    while (q--) {
        solve();
    }
    return 0;
}