51Nod 1183 编辑距离

 1 #include <iostream>
 2 #include <cstring>
 3 using namespace std;
 4 typedef long long ll;
 5 const int N = 1e3 + 5;
 6 int T, cas = 0;
 7 int n, m;
 8 int dp[N][N];
 9 char s[N],t[N];
10 int main()
11 {
12     while (scanf("%s%s", s, t) != EOF){
13         int n = strlen(s), m = strlen(t);
14         for (int i = 0; i <= n; i++)
15             dp[i][0] = i;
16         for (int i = 0; i <= m; i++)
17             dp[0][i] = i;
18         for (int i = 1; i <= n; i++){
19             for (int j = 1; j <= m; j++){
20                 dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + 1;
21                 dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + (s[i - 1] != t[j - 1]));
22             }
23         }
24         printf("%d\n", dp[n][m]);
25     }
26     return 0;
27 }