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
#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>tab(n*2+2);
    vector<vector<int>>JUMP(n*2+2,vector<int>(ceil(log(n)/log(2)+1)));
    for(int i=1;i<=n;i++)
    {
        cin>>tab[i];
    }
    if(n==1){return 1;}
    if(n==2){return 1+(tab[1]!=tab[2]);}
    for(int i=1;i<=n;i++)
    {
        tab[i+n]=tab[i];
    }
    vector<pair<int,int>>U={{INT_MAX,2*n+1}};
    for(int i=n*2;i>=1;i--)
    {
        int l=0,p=(int)U.size()-1;
        while(l<p)
        {
            const int mid=(l+p+1)>>1;
            if(tab[i]<U[mid].first){l=mid;}
            else{p=mid-1;}
        }
        while(U.back().first<=tab[i])
        {
            U.pop_back();
        }
        U.push_back({tab[i],i});
        JUMP[i][0]=U[l].second;
    }
    JUMP[n*2+1][0]=n*2+1;
    for(int j=1;j<(int)JUMP[0].size();j++)
    {
        for(int i=1;i<=n*2+1;i++)
        {
            JUMP[i][j]=JUMP[JUMP[i][j-1]][j-1];
        }
    }
    int wynik=0;
    for(int i=1;i<=n;i++)
    {
        int kand=1;
        int v=i;
        for(int j=(int)JUMP[0].size()-1;j>=0;j--)
        {
            if(JUMP[v][j]<=n+i)
            {
                kand+=(1<<j);
                v=JUMP[v][j];
            }
        }
        wynik=max(wynik,kand);
    }
    cout<<wynik<<'\n';
    return 0;
}