hdu 1423 Greatest Common Increasing Subsequence_LICS(最长公共递增子序列)

#include <iostream>
#include <cstring>
using namespace std;
int dp[1005][1005];
int a[100010],b[100010];
int main()
{
    int t,i,j,m,n;
    cin>>t;
    while(t--)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(dp,0,sizeof(dp));
        cin>>m;
        for(i=1; i<=m; i++)
            cin>>a[i];
        cin>>n;
        for(i=1; i<=n; i++)
            cin>>b[i];
        for(i=1; i<=m; i++)
            for(j=1; j<=n; j++)
        {
            if(a[i]==b[j]&&a[i]>a[i-1]&&a[i]>b[j-1])
                dp[i][j]=dp[i-1][j-1]+1;
            else
                dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
        }
        cout<<dp[m][n]<<endl;
        if(t)
            cout<<endl;
    }
    return 0;
}