编辑距离

#include <bits/stdc++.h>
using namespace std;
const int N=2000;
char c1[N],c2[N];
int n,m,f[N][N];
int main() {
    scanf("%d", &n);
    scanf("%s", c1 + 1);
    scanf("%d", &m);
    scanf("%s", c2 + 1);
    for (int i = 1; i <= n; i++) {
        f[i][0] = i;
    }
    for (int i = 1; i <= m; i++) {
        f[0][i] = i;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            f[i][j] = min(f[i - 1][j]+1, f[i][j - 1]+1);
            if (c1[i] == c2[j]) {
                f[i][j] = min(f[i][j], f[i - 1][j - 1]);
            } else {
                f[i][j] = min(f[i][j], f[i - 1][j - 1] + 1);
            }
        }
    }
    printf("%d
",f[n][m]);
}