传送门(洛谷)
f [ i ] [ j ] f[i][j] f[i][j]表示 a a a串的前 i i i个数转化为 b b b串的前 j j j个数的最小代价
若
a
[
i
]
=
=
b
[
j
]
a[i]==b[j]
a[i]==b[j]
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
−
1
]
[
j
−
1
]
,
m
i
n
(
f
[
i
−
1
]
[
j
]
+
1
,
f
[
i
]
[
j
−
1
]
+
1
)
)
f[i][j]=min(f[i-1][j-1],min(f[i-1][j]+1,f[i][j-1]+1))
f[i][j]=min(f[i−1][j−1],min(f[i−1][j]+1,f[i][j−1]+1))
否则
f
[
i
]
[
j
]
=
m
i
n
(
f
[
i
−
1
]
[
j
−
1
]
+
1
,
m
i
n
(
f
[
i
−
1
]
[
j
]
+
1
,
f
[
i
]
[
j
−
1
]
+
1
)
)
f[i][j]=min(f[i-1][j-1]+1,min(f[i-1][j]+1,f[i][j-1]+1))
f[i][j]=min(f[i−1][j−1]+1,min(f[i−1][j]+1,f[i][j−1]+1))
f
[
i
−
1
]
[
j
]
f[i-1][j]
f[i−1][j]表示删掉这个数
f
[
i
]
[
j
−
1
]
f[i][j-1]
f[i][j−1]表示在
A
A
A串添加一个数
Code(递推版)
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
const int maxn=1e6+10;
const int maxm=3e3+10;
int len1,len2,ans;
char a[maxn],b[maxn];
int f[maxm][maxm];
template <class t> inline void read(t &x) {
int f=1;x=0;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
x*=f;
}
void readdata() {
scanf("%s%s",a+1,b+1);
len1=strlen(a+1);
len2=strlen(b+1);
memset(f,false,sizeof(f));
}
void work() {
rep(i,1,len1) f[i][0]=i;
rep(i,1,len2) f[0][i]=i;
rep(i,1,len1) {
rep(j,1,len2) {
if(a[i]==b[j]) f[i][j]=f[i-1][j-1];
else f[i][j]=min(f[i-1][j],min(f[i][j-1],f[i-1][j-1]))+1;
}
}
printf("%d\n",f[len1][len2]);
}
int main() {
freopen("input.txt","r",stdin);
readdata();
work();
return 0;
}
Code(记搜版)
#include<bits/stdc++.h>
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
const int maxn=3e5+10;
const int maxm=3e3+10;
int len1,len2,ans;
char a[maxn],b[maxn];
int f[maxm][maxm];
template <class t> inline void read(t &x) {
int f=1;x=0;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
x*=f;
}
void readdata() {
scanf("%s%s",a+1,b+1);
len1=strlen(a+1);
len2=strlen(b+1);
memset(f,0x3f,sizeof(f));
}
inline int dfs(int x,int y) {
if(f[x][y]!=0x3f3f3f3f) return f[x][y];
int delta=1;
if(a[x]==b[y]) delta=0;//f[x][y]=f[x-1][y-1];
return f[x][y]=min(dfs(x-1,y-1)+delta,min(dfs(x-1,y)+1,dfs(x,y-1)+1));
}
void work() {
rep(i,1,len1) f[i][0]=i;
rep(i,1,len2) f[0][i]=i;
dfs(len1,len2);
printf("%d",f[len1][len2]);
}
int main() {
freopen("input.txt","r",stdin);
readdata();
work();
return 0;
}