Greatest Common Increasing Subsequence

/*HDU1423 最长公共递增*/
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
#define N 550
int dp

;
int s
,t
;

int main()
{
int t1;
while(scanf("%d",&t1)!=EOF)
{
while(t1--)
{
int n,m;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&s[i]);
scanf("%d",&m);
for(int i=1;i<=m;i++)
scanf("%d",&t[i]);
memset(dp,0,sizeof(dp));
int mx=0;
for(int i=1;i<=n;i++)
{
mx=0;
for(int j=1;j<=m;j++)
{
dp[i][j] = dp[i-1][j];
if( s[i]>t[j])
{
mx=dp[i-1][j];
}
if( s[i] == t[j] )
{
dp[i][j]=mx+1;
}
}
}
mx=-1;
int id;
for(int i=1;i<=m;i++)
if(dp
[i]>mx)
{
mx=dp
[i];
}
printf("%d\n",mx);
if(t1!=0) printf("\n");
}
}
return 0;
}