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
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
const int max_n = 1000000;
int dp[max_n + 7];
int a[max_n + 7];
int v[max_n + 7];
int n;
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)cin >> v[i];
    int last = v[1] , id = 1;
    for(int i = 2; i <= n; i++)
    {
        if(v[i] > last)
        {
            id = i;
            last = v[i];
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if((i + id) % n == 0)a[i] = v[n];
        else a[i] = v[(i + id) % n];
    }
    vector <int> q;
    for(int i = n; i >= 1; i--)
    {
        while(!q.empty() && a[q.back()] <= a[i])
        {
            q.pop_back();
        }
        if(!q.empty())
        {
            dp[i] = dp[q.back()] + 1;
        }
        else dp[i] = 1;
        q.pb(i);
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)ans = max(ans , dp[i]);
    cout << ans;
    return 0;
}