HDU1423Greatest Common Increasing Subsequence

Problem Description
    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<iostream>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<string.h>
using namespace std;

int a[520],b[520],dp[520];

int main()
{
    int tt,p,q;
    scanf("%d",&tt);
    while(tt--)
    {
        memset(dp,0,sizeof(dp));
        scanf("%d",&p);
        for(int i=0;i<p;i++)
            scanf("%d",&a[i]);
        scanf("%d",&q);
        for(int i=0;i<q;i++)
            scanf("%d",&b[i]);
        int maxx;
        for(int i=0;i<p;i++)
        {
            maxx=0;//注意一下，这里不能设置为负无穷，因为dp记录最长长度，最小是为0
            for(int j=0;j<q;j++)
            {
                if(a[i]>b[j])
                    maxx=max(dp[j],maxx);
                else if(a[i]==b[j])
                    dp[j]=maxx+1;
            }
        }
        int ans=0;
        for(int i=0;i<q;i++)
            ans=max(ans,dp[i]);
        if(tt)
            printf("%d\n\n",ans);
        else
            printf("%d\n",ans);
    }
    return 0;
}