uva10066 - The Twin Towers(LCS)

题意：
题目意思其实就是给你两串数字，求最长公共子序列
思路：
只是题意变了，其它都没变，跟前面几题最长公共子序列做法完全相同。
代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 105;
int a[N], b[N], dp[N][N];

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