CSU 1120 病毒（DP）

 题目链接：http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1120

解题报告：dp，用一个串去更新另一个串，递推方程是：

if(b[i] > a[j])
m = max(m,dp[j]);
else if(b[i] == a[j]) dp[j] = m + 1;

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1005;
int a[maxn],b[maxn],dp[maxn];

int main()
{
    int T,n,m;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        for(int i = 1;i <= n;++i)
        scanf("%d",&a[i]);
        scanf("%d",&m);
        for(int i = 1;i <= m;++i)
        scanf("%d",&b[i]);
        memset(dp,0,sizeof(dp));
        for(int i = 1;i <= m;++i)
        {
            int m = 0;
            for(int j = 1;j <= n;++j)
            {
                if(b[i] > a[j])
                m = max(m,dp[j]);
                else if(b[i] == a[j]) dp[j] = m + 1;
            }
        }
        int ans = 0;
        for(int i = 1;i <= n;++i)
        ans = max(ans,dp[i]);
        printf("%d
",ans);
    }
    return 0;
}