UVA - 10066 The Twin Towers（LCS最长公共子序列）

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<string>
#include<queue>
#include<map>
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
const int INF = 0x3f3f3f3f;
const int NINF = -INF -1;
const int MAXN = 100+5;
using namespace std;
int n1, n2;
int a[MAXN], b[MAXN];
int dp[MAXN][MAXN];
int main() {
int T = 0;
while (scanf("%d%d", &n1, &n2) && n1+n2) {
for (int i = 0; i < n1; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n2; i++)
scanf("%d", &b[i]);
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n1; i++)
for (int j = 1; j <= n2; j++)
if (a[i-1] == 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]);
printf("Twin Towers #%d\nNumber of Tiles : %d\n\n", ++T, dp[n1][n2]);
}
return 0;
}