第一次写这种字符串距离型DP,本来DP题目做得就少,权当练习。
这个题目要求字符串A、B扩展串的最短距离
用f[i,j]表示A到i位置,B到j位置的最短距离,则f[i,j]=min{f[i-1,j]+k,f[i,j-1]+k,f[i-1,j-1]+d}
其中d为A[i]与B[j]的ASCII码距离的差的绝对值,即d=abs(ord(a[i])-ord(b[j])),k为题目所述
[pascal 代码]
VAR
a,b:ansistring;
f:array[0..2100,0..2100]of longint;
k,n,m,i,j,dis:longint;
BEGIN
readln(a);
readln(b);
readln(k);
n:=length(a);m:=length(b);
fillchar(f,sizeof(f),$3f);
for i:=0 to n do f[i,0]:=i*k;
for i:=0 to m do f[0,i]:=i*k;
for i:=1 to n do
for j:=1 to m do
begin
if f[i-1,j]+k<f[i,j] then f[i,j]:=f[i-1,j]+k;
if f[i,j-1]+k<f[i,j] then f[i,j]:=f[i,j-1]+k;
dis:=abs(ord(a[i])-ord(b[j]));
if f[i-1,j-1]+dis<f[i,j] then f[i,j]:=f[i-1,j-1]+dis;
end;
writeln(f[n,m]);
END.