POJ1458 Common Subsequence —— DP 最长公共子序列（LCS）

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <vector>
 7 #include <queue>
 8 #include <stack>
 9 #include <map>
10 #include <string>
11 #include <set>
12 #define ms(a,b) memset((a),(b),sizeof((a)))
13 using namespace std;
14 typedef long long LL;
15 const double EPS = 1e-8;
16 const int INF = 2e9;
17 const LL LNF = 2e18;
18 const int MAXN = 1e3+10;
19 
20 char a[MAXN], b[MAXN];
21 int dp[MAXN][MAXN];
22 
23 int main()
24 {
25     while(scanf("%s%s", a+1, b+1)!=EOF)
26     {
27         int n = strlen(a+1);
28         int m = strlen(b+1);
29 
30         ms(dp, 0);
31         for(int i = 1; i<=n; i++)
32         for(int j = 1; j<=m; j++)
33         {
34             if(a[i]==b[j])
35                 dp[i][j] = dp[i-1][j-1]+1;
36             else
37                 dp[i][j] = max(dp[i][j-1], dp[i-1][j]);
38         }
39         printf("%d\n", dp[n][m]);
40     }
41 }