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 <bits/stdc++.h>

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 1'000'007;
int tab[N * 2];
int il[N * 2];

void Solve()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> tab[i];
        tab[i + n] = tab[i];
    }
    tab[0] = 2 * N;
    vector<int> q = {0};
    for(int i = 1; i <= 2 * n; ++i)
    {
        while(tab[q.back()] < tab[i])
            q.pop_back();
        ++il[q.back() + 1];
        --il[i + 1];
        q.pb(i);
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i)
    {
        il[i] += il[i - 1];
        ans = max(ans, il[i]);
    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}