UVA - 10405 Longest Common Subsequence

题目大意：求两个字符串的最长公共子序列

解题思路：运用状态转移方程

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

int main() {
char A[1005], B[1005];
while (gets(A)) {
gets(B);
int n = strlen(A);
int m = strlen(B);
int DP[1005][1005] = {0};
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
if (A[i-1] == B[j-1])
DP[i][j] = DP[i-1][j-1] + 1;
else
DP[i][j] = max(DP[i][j-1], DP[i-1][j]);
printf("%d\n", DP
[m]);
}
return 0;
}