hdu 1423(LCS+LIS)

///公共最长上升子序列
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#define N 505
using namespace std;

int dp[N][N],flag[N][N];
int dp1[N];
int a[N],b[N],c[N];
int n,m,k;

void solve_c(int i,int j){
    if(i==0||j==0) return;
    if(flag[i][j]==0){
        solve_c(i-1,j-1);
        c[++k] = a[i];
    }else if(flag[i][j]==1){
        solve_c(i-1,j);
    }else solve_c(i,j-1);
}
void LCS(){
    memset(flag,0,sizeof(flag));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i]==b[j]){
                dp[i][j] = dp[i-1][j-1]+1;
                flag[i][j]=0;
            }else{
                if(dp[i-1][j]>dp[i][j-1]) flag[i][j]=1;
                else flag[i][j]=-1;
                dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            }
        }
    }
    //printf("%d",dp[n][m]);
    k = 0;
    solve_c(n,m);
    //for(int i=1;i<=k;i++) printf("%d ",c[i]);
}
void LIS(){
    dp1[1] = 1;
    int mx = 1;
    for(int i=2;i<=k;i++){
        dp1[i]=1;
        for(int j=1;j<i;j++){
            if(c[i]>c[j]&&dp1[i]<dp1[j]+1){
                dp1[i] = dp1[j]+1;
            }
            if(mx<dp1[i]) mx=dp1[i];
        }
    }
    if(k==0) mx = 0;
    printf("%d\n",mx);
}
int main()
{
    int tcase;
    scanf("%d",&tcase);
    while(tcase--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
        }
        memset(dp,0,sizeof(dp));
        LCS();
        LIS();
        if(tcase) printf("\n");
    }
    return 0;
}