线性DP AcWing 899. 编辑距离

原题链接

AcWing 899. 编辑距离

算法标签

动态规划 线性DP

代码

#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 1005, INF = 0x3f3f3f3f;
int n,m;
char s[N][N], a[N];
int f[N][N];
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
int dis(char a[], char b[]){
    rep(i, 0, strlen(a+1)+1){
        f[i][0]=i;
    }
    rep(i, 0, strlen(b+1)+1){
        f[0][i]=i;
    }
    rep(i, 1, strlen(a+1)+1){
        rep(j, 1, strlen(b+1)+1){
            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[strlen(a+1)][strlen(b+1)];
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    n=read(),m=read();
    rep(i, 0, n){
        scanf("%s", s[i]+1);
    }
    while(m--){
        int ans=0;
        scanf("%s", a+1);
        int b=read();
        rep(i, 0, n){
            if(dis(s[i], a)<=b){
                ans++;
            }
        }
        printf("%lld\n", ans);
    }
    return 0;
}

原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈