HDU 1423 Greatest Common Increasing Subsequence

最长公共上升子序列   LCIS 看这个博客  http://www.cnblogs.com/nuoyan2010/archive/2012/10/17/2728289.html

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;

int num1[505],num2[505],dp[505][505];
int main( )
{
    int N,M,T; scanf("%d",&T);
    while( T-- )
    {
        scanf("%d",&N);
        for( int i = 1; i <= N; i++ )scanf("%d",&num1[i]);
        scanf("%d",&M);
        for( int i = 1; i <= M; i++ )scanf("%d",&num2[i]);
        memset( dp,0,sizeof(dp) );
        for( int i = 1; i <= N; i++ )
        {
            int Max = 0;
            for( int j = 1; j <= M; j++ )
            {
                if( num1[i] >  num2[j] && dp[i-1][j] > Max )Max = dp[i-1][j];
                if( num1[i] == num2[j] )
                     dp[i][j] = Max + 1 ;
                else dp[i][j] = dp[i-1][j];
            }
        }
        int res = 0;
        for( int i = 1; i <= M; i++ )res = max( res,dp[N][i] );
        cout<<res<<endl;
        if( T )puts("");
    }
    return 0;
}