字串距离（特长生2016）【DP】

>Link

luogu P1279

---

>解题思路

比赛的时候打的dp打挂了🤕

由题意得，两个空格相互匹配的情况距离为0，所以我们可以不用理这种情况
数组$f_{i,j}$ 表示第一个字符串$a$前$i$个字符与第二个字符串$b$前$j$个字符相匹配，所得的最短距离
所以可得状态转移方程：
$f_{i,j}=min\{\begin{array}{c}{f}_{i-1,j-1}+|a_i-b_j|（两个字符相匹配）\\ f_{i-1,j}+k（a_i与空格匹配）\\ f_{i,j-1}+k（b_j与空格匹配）\end{array}$

---

>代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 2010
using namespace std;

int n, m, k, f[N][N];
string a, b;

int main()
{
	cin >> a >> b;
	scanf ("%d", &k);
	n = a.size(), m = b.size();
	a = " " + a, b = " " + b;
	for (int i = 1; i <= n; i++) f[i][0] = k * i;
	for (int i = 1; i <= m; i++) f[0][i] = k * i; //初始化
	for (int i = 1; i <= n; i++)
	  for (int j = 1; j <= m; j++)
	  {
	  	f[i][j] = f[i - 1][j - 1] + abs (a[i] - b[j]);
	  	f[i][j] = min (f[i][j], f[i - 1][j] + k);
	  	f[i][j] = min (f[i][j], f[i][j - 1] + k);
	  }
	printf ("%d", f[n][m]);
	return 0;
}