51nod 1183 编辑距离(dp)

题目链接：51nod 1183 编辑距离

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1001;
char a[N], b[N];
int dp[N][N];//dp[i][j]:a串的前i个字符转化成b串的前j个字符的最少操作数
int main(){
    int i, j;
    scanf("%s%s", a+1, b+1);
    int alen = strlen(a+1);
    int blen = strlen(b+1);
    for(i = 0; i <= alen; ++i)
        dp[i][0] = i;
    for(j = 0; j <= blen; ++j)
        dp[0][j] = j;
    for(i = 1; i <= alen; ++i)
        for(j = 1; j <= blen; ++j)
            dp[i][j] = min(dp[i-1][j-1] + (a[i]!=b[j]), min(dp[i-1][j]+1, dp[i][j-1]+1));
    printf("%d\n", dp[alen][blen]);
    return 0;
}