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
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin>>n;

    vector<int> a(2*n);

    for(int i=0; i<n; i++)
    {
        cin>>a[i];

        a[i+n]=a[i];
    }

    vector<int> prev(2*n);
    stack<int> s;

    for(int i=0; i<2*n; i++)
    {
        while(!s.empty() && a[s.top()]<a[i])
        {
            s.pop();
        }

        if(s.empty())
        {
            prev[i]=-1;
        }
        else
        {
            prev[i]=s.top();
        }

        s.push(i);
    }

    vector<int> diff(n+1,0);

    for(int j=0; j<2*n-1; j++)
    {
        int l=max({0,j-n+1,prev[j]+1});
        int r=min(n-1,j);

        if(l<=r)
        {
            diff[l]++;
            diff[r+1]--;
        }
    }

    int delights=0;
    int current=0;

    for(int k=0; k<n; k++)
    {
        current+=diff[k];

        if(current>delights)
        {
            delights=current;
        }
    }

    cout<<delights<<endl;

    return 0;
}