/*
直到目前,这题后台数据都是错的
*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
const int inf = 99999999;
const int maxn = 999999;
int dp[maxn],a[maxn],b[maxn],d[maxn],dd[maxn],same[maxn];
int n;
using namespace std;
int solve(){
int ans=0;
fill(dp,dp+n,inf);
fill(same,same+n,inf);
memset(d,0,sizeof(d));
memset(dd,0,sizeof(dd));
for(int i=0;i<n;i++){
*upper_bound(dp,dp+n,a[i])=a[i];
d[i]=upper_bound(dp,dp+n,a[i])-dp;
same[i]=min(same[i],upper_bound(dp,dp+n,a[i])-lower_bound(dp,dp+n,a[i]));
}
fill(dp,dp+n,inf);
for(int i=0;i<n;i++){
*upper_bound(dp,dp+n,b[i])=b[i];
dd[i]=upper_bound(dp,dp+n,b[i])-dp;
same[i]=min(same[i],upper_bound(dp,dp+n,b[i])-lower_bound(dp,dp+n,b[i]));
}
for(int i=0;i<n;i++){
ans=max(ans,d[i]+dd[i]-same[i]);
}
return ans;
}
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=n-1;i>=0;i--){
scanf("%d",&a[i]);
b[i]=-a[i];
}
printf("%d\n",solve());
}
return 0;
}
hdu 4604 强劲数据版
最新推荐文章于 2019-10-01 10:52:24 发布