Greatest Common Increasing Subsequence

This is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.

Input

Each sequence is described with M - its length (1 <= M <= 500) and M integer numbers Ai (-2^31 <= Ai < 2^31) - the sequence itself.

Output

output print L - the length of the greatest common increasing subsequence of both sequences.

Sample Input

1

5
1 4 2 5 -12
4
-12 1 2 4

Sample Output

2

思路：题目是给两个序列求最长上升公共子序列，利用dp直接写。

#include<stdio.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
int dp[510],a[510],b[510];
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(dp,0,sizeof(dp));
        int n,m,i,j;
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%d",&a[i]);
        scanf("%d",&m);
        for(i=0;i<m;i++)
            scanf("%d",&b[i]);
        int maxx;
        for(i=0;i<n;i++)
        {
            maxx=0;
            for(j=0;j<m;j++)
            {
                if(a[i]==b[j])
                    dp[j]=maxx+1;
                if(a[i]>b[j]&&dp[j]>maxx)
                    maxx=dp[j];
            }
        }
        maxx=0;
        for(i=0;i<m;i++)
            if(maxx<dp[i])
                maxx=dp[i];
        printf("%d\n",maxx);
        if(t)
            printf("\n");
    }
    return 0;
}