uva 10066 The Twin Towers（动态规划：LCS）

水题一道

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 110
using namespace std;

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

int main(void) {
    int len1, len2, t;
    t = 1;
    while(scanf("%d%d", &len1, &len2) && (len1||len2)) {
        for(int i=1; i<=len1; ++i)
            scanf("%d", &a[i]);
        for(int j=1; j<=len2; ++j)
            scanf("%d", &b[j]);
        memset(dp, 0, sizeof(dp));
        for(int i=1; i<=len1; ++i) {
            for(int j=1; j<=len2; ++j) {
                if(a[i] == b[j])
                    dp[i][j] = max(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[len1][len2]);
    }
    return 0;
}