【51nod-1183】编辑距离

链接：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1183

#include <bits/stdc++.h>
using namespace std;
const int N = ;
char s1[N], s2[N];
int dp[N][N];
int main()
{
    cin>>s1>>s2;
    int l1 = strlen(s1);
    int l2 = strlen(s2);
    for(int i = ; i < l1; i++) dp[i+][] = i+;
    for(int i = ; i < l2; i++) dp[][i+] = i+;
    for(int i = ; i < l1; i++)
        for(int j = ; j < l2; j++)
        {
            if(s1[i] == s2[j]) dp[i+][j+] = dp[i][j];
            else dp[i+][j+] = min(dp[i][j], min(dp[i+][j], dp[i][j+]))+;
        }
    printf("%d\n", dp[l1][l2]);
    return ;
}