J - 病毒 CSU - 1120

最长递增公共子序列。

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<functional>
#include<set>
#include<map>
#include<cstdlib>
#include<vector>
#include<cmath>
#include <algorithm>
#pragma warning(disable:4996)
using namespace std;
int n, m, t, i, j, cnt, x;
int a[1010];
int b[1010];
int dp[1010][1010];
int LICS()
{
	int MAX;
	memset(dp, 0, sizeof(dp));
	for (i = 1; i <= n; i++)
	{
		MAX = 0;
		for (j = 1; j <= m; j++)
		{
			dp[i][j] = dp[i - 1][j];
			if (a[i]>b[j] && MAX<dp[i - 1][j])
				MAX = dp[i - 1][j];
			if (a[i] == b[j])
				dp[i][j] = MAX + 1;
		}
	}
	MAX = 0;
	for (i = 1; i <= m; i++)
		if (MAX<dp[n][i])
			MAX = dp[n][i];
	return MAX;
}
int main()
{
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d", &n);
		memset(a, 0, sizeof(a));
		memset(b, 0, sizeof(b));
		for (i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		scanf("%d", &m);
		for (i = 1; i <= m; i++)
			scanf("%d", &b[i]);
		printf("%d\n", LICS());
	}
	//	system("pause");
	return 0;
}