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

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

    int n;
    cin >> n;
    vector<int> chain(n);
    int maxI = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> chain[i];
        if (chain[i] > chain[maxI])
        {
            maxI = i;
        }
    }
    rotate(chain.begin(), chain.begin() + maxI + 1, chain.end());
    reverse(chain.begin(), chain.end());

    stack<int> pearls;
    pearls.push(chain[0]);
    int wyn = 1;
    for (int i = 1; i < n; i++)
    {
        // cout << chain[i];
        while (!pearls.empty() && pearls.top() <= chain[i])
        {
            wyn = max(wyn, (int)pearls.size());
            pearls.pop();
        }
        pearls.push(chain[i]);
    }
    wyn = max(wyn, (int)pearls.size());
    // cout << "\n";
    cout << wyn << "\n";
}