#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[200010],a[200010],l[200010],r[200010];
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
l[1]=1;
for(int i=2;i<=n;i++)
l[i]=a[i]>a[i-1]?l[i-1]+1:1;
r[n]=1;
for(int i=n-1;i>0;i--)
r[i]=a[i]<a[i+1]?r[i+1]+1:1;
int res=0;
memset(dp,0x3f,sizeof(dp));
for(int i=1;i<=n;i++){
int t=lower_bound(dp+1,dp+1+n,a[i])-dp;
res=max(res,t+r[i]-1);
dp[l[i]]=min(dp[l[i]],a[i]);
}
printf("%d\n",res);
}
}
LA 3525 Wild West 单调性
最新推荐文章于 2024-01-03 03:21:11 发布