Acwing 899. 编辑距离

 本题与最短编辑距离类似，只不过是多了判断是否满足在操作次数上限内，是否可以变成相应的字符串，逐个遍历求解即可。

#include <iostream>
#include <algorithm>
#include <cstring>   // strlen

using namespace std;

const int N = 15, M = 1010;

int n, m;
int f[N][N];
char str[M][N];   // 存储给定的n个字符串

int edit_distance(char a[], char b[])  // a改到b最短编辑距离
{
    int la = strlen(a + 1), lb = strlen(b + 1);

    for (int i = 0; i <= lb; i ++ ) f[0][i] = i;
    for (int i = 0; i <= la; i ++ ) f[i][0] = i;

    for (int i = 1; i <= la; i ++ )
        for (int j = 1; j <= lb; j ++ )
        {
            f[i][j] = min(f[i - 1][j] + 1, f[i][j - 1] + 1);
            f[i][j] = min(f[i][j], f[i - 1][j - 1] + (a[i] != b[j]));
        }

    return f[la][lb];
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; i ++ ) scanf("%s", str[i] + 1);

    while (m -- )
    {
        char s[N];  // 存储给定询问的字符串
        int limit;
        scanf("%s%d", s + 1, &limit);

        int res = 0;
        for (int i = 0; i < n; i ++ )  // 每个询问枚举所有给定字符串
            if (edit_distance(str[i], s) <= limit)
                res ++ ;

        printf("%d\n", res);
    }

    return 0;
}