vijos P1680距离

https://vijos.org/p/1680#include<iostream>#include<cstring>#include<cstdio>#include<cmath>using namespace std;char s1[2222],s2[2222];int dp[2222][2222];int min(int a,int b,int c){b=b<c?b:c;return a<b?a:b;}int main(){int i,j,m,n,k;while(scanf("%s%s",s1,s2)!=EOF){scanf("%d",&k);n=strlen(s1);m=strlen(s2);for(i=0;i<=m;i++)dp[0][i]=i*k;for(i=0;i<=n;i++)dp[i][0]=i*k;for(i=1;i<=n;i++){for(j=1;j<=m;j++){if(s1[i-1]==s2[j-1]){dp[i][j]=dp[i-1][j-1];}else{dp[i][j]=min(dp[i-1][j-1]+abs(s1[i-1]-s2[j-1]),dp[i-1][j]+k,dp[i][j-1]+k);}}}printf("%d\n",dp[n][m]);}return 0;}