51nod 1183 编辑距离

#include <bits/stdc++.h>
using namespace std;

int dp[1010][1010];

int main()
{
string a,b;
int i,j;
while(cin>>a>>b)
{
memset(dp,60,sizeof(dp));
for(i=0;i<=a.length();i++)
dp[i][0]=i;
for(j=0;j<=b.length();j++)
dp[0][j]=j;
for(i=1;i<=a.length();i++)
{
for(j=1;j<=b.length();j++)
{
dp[i][j]=min(min(dp[i-1][j],dp[i][j-1])+1,dp[i-1][j-1]+(a[i-1]==b[j-1]?0:1));
}
}
printf("%d\n",dp[a.length()][b.length()]);
}
}