hdu4512 吉哥系列故事——完美隊形I

準備知識：最長公用上升子序列 http://www.clarkok.com/blog/?p=353

#include<iostream>#include<cstring>#include<cstdio>using namespace std;int main(){int a[210],f[210];int t,n;int i,j,k,ans;scanf("%d",&t);while(t--){memset(f,0,sizeof(f));ans=-1;scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",&a[i]);for(i=n;i>=1;i--){k=0;for(j=1;j<=i;j++){if(a[i]==a[j])if(i!=j){if(f[j]<f[k]+2)f[j]=f[k]+2;}else{if(f[j]<f[k]+1)f[j]=f[k]+1;}else if(a[i]>a[j]){if(f[j]>f[k])k=j;}if(f[j]>ans)ans=f[j];}}printf("%d\n",ans);}return 0;}