题目描述
线性做法
我们设left[i]表示最大的k
#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
using namespace std;
const int maxn=10000000+10;
int left[maxn],right[maxn],b[maxn],s[maxn],father[maxn],a[maxn];
int i,j,k,l,t,n,m,top,tot,ans;
int read(){
int x=0;
char ch=getchar();
while (ch<'0'||ch>'9') ch=getchar();
while (ch>='0'&&ch<='9'){
x=x*10+ch-'0';
ch=getchar();
}
return x;
}
int getfa(int x){
return father[x]?father[x]=getfa(father[x]):x;
}
int main(){
n=read();
fo(i,1,n) b[i]=read();
s[0]=0;
fo(i,1,n){
while (top&&b[i]>=b[s[top]]) top--;
left[i]=s[top];
s[++top]=i;
}
top=0;
s[0]=n+1;
fd(i,n,1){
while (top&&b[i]<=b[s[top]]) top--;
right[i]=s[top];
s[++top]=i;
}
fo(i,0,n+1) s[i]=0;
fo(i,1,n) s[right[i]]++;
fo(i,1,n+1) s[i]+=s[i-1];
fo(i,1,n){
a[s[right[i]]]=i;
s[right[i]]--;
}
j=1;
fo(i,1,n){
while (j<=n&&right[a[j]]<=i){
father[a[j]]=a[j]+1;
j++;
}
t=getfa(left[i]+1);
ans=max(ans,i-t+1);
}
printf("%d\n",ans);
}