11.编辑距离

 时间复杂度1000 * 1000 * 100

#include <bits/stdc++.h>
using namespace std;
const int N = 15, M = 1010;
int n, m;
char str[M][N];
int dp[N][N];
int edit_distance(char str[], char s[]) {
    int la = strlen(str + 1), lb = strlen(s + 1);
    for (int i = 0; i <= lb; i++) {
        dp[0][i] = i;
    }
    for (int i = 0; i <= la; i++) {
        dp[i][0] = i;
    }
    for (int i = 1; i <= la; i++) {
        for (int j = 1; j <= lb; j++) {
            dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
            dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + (str[i] != s[j]));
        }
    }
    return dp[la][lb];
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> str[i] + 1;
    }
    while (m--) {
        char s[N];
        int limit;
        cin >> s + 1 >> limit;
        int cnt = 0;
        for (int i = 1; i <= n; i++) {
            if (edit_distance(str[i], s) <= limit) {
                cnt++;
            }
        }
        cout << cnt << endl;
    }
    return 0;
}