P2758编辑距离

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int f[2005][2005];
//f[i][j]表示把a[1..i]变成b[i..j]的最少操作次数
string a, b;
int main() {
	cin >> a >> b;
	int n = int(a.size());
	int m = int(b.size());
	a = ' ' + a;
	b = ' ' + b;
	memset(f, 0x3f, sizeof(f));
	for (int i = 0; i <= m; i++) {
		f[0][i] = i;
	}
	for (int i = 0; i <= n; i++) {
		f[i][0] = i;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (a[i] == b[j]) {
				f[i][j] = f[i - 1][j - 1];
			} else {
				f[i][j] = min({f[i - 1][j] + 1, f[i][j - 1] + 1, f[i - 1][j - 1] + 1});
			}
		}
	}
	cout << f[n][m];
	return 0;
}