UVA - 10066The Twin Towers（LIS）

题目：UVA - 10066The Twin Towers（LIS）

题目大意：求两个整数序列的最长公共子序列。

解题思路：和uva10405同样的思路。注意每组输出后面要输出空行，不然会WA。

代码：

#include <cstdio>
#include <cstring>

const int N = 105;

int s1[N], s2[N];
int l[N][N];
int l1, l2;

void init () {

	memset (l, 0, sizeof (l));
}

int Max (const int a, const int b) { return a > b? a: b; }

int main () {

	int cas = 0;
	while (scanf ("%d%d", &l1, &l2), l1 || l2) {

		for (int i = 0; i < l1; i++)
			scanf ("%d", &s1[i]);
		for (int i = 0; i < l2; i++)
			scanf ("%d", &s2[i]);

		init ();

		for (int i = 1; i <= l1; i++)
			for (int j = 1; j <= l2; j++)
				if (s1[i - 1] == s2[j - 1])
					l[i][j] = l[i - 1][j - 1] + 1;
				else
					l[i][j] = Max (l[i][j - 1], l[i - 1][j]);
		printf ("Twin Towers #%d\n", ++cas);
		printf ("Number of Tiles : %d\n\n", l[l1][l2]);
	}
	return 0;
}

UVA - 10066The Twin Towers（LIS）