HDU 1423（Greatest Common Increasing Subsequence）

最长公共子序列题，套用模板即可。

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 505;

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

//计算最长递增公共子序列的长度
int LCIS(int n, int m)
{
	memset(dp, 0, sizeof(dp));
	for (int i = 0; i < n; i++)
	{
		int k = MAXN - 1;
		for (int j = 0; j < m; j++)
		{
			if (a[i] == b[j])
				dp[j] = max(dp[j], dp[k] + 1);
			else if (a[i] > b[j] && dp[k] < dp[j])
				k = j;
		}
	}

	int ans = 0;
	for (int i = 0; i < m; i++)
	{
		if (dp[i] > ans)
			ans = dp[i];
	}
	return ans;
}

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n, m;
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			cin >> a[i];
		}
		cin >> m;
		for (int i = 0; i < m; i++)
		{
			cin >> b[i];
		}
		cout << LCIS(n, m) << endl;
		if (T > 0)
			cout << endl;
	}
	return 0;
}

继续加油。