[DP]最长公共上升子序列LCIS

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int T,n,m,f[510];long long a[510],b[510];int main(){scanf("%d",&T);while(T--){scanf("%d",&n);memset(f,0,sizeof(f));for(int i=1;i<=n;++i)scanf("%lld",&a[i]);scanf("%d",&m);for(int i=1;i<=m;++i)scanf("%lld",&b[i]);for(int i=1;i<=n;++i){int M=0;for(int j=1;j<=m;++j){if(a[i]>b[j] && M<f[j])M=f[j];if(a[i]==b[j])f[j]=M+1;}}int M=0;for(int i=1;i<=m;i++)if(M<f[i])M=f[i];printf("%d\n",M);}return 0;}