题目大意:
找两条从[1,1]走到[N,M]不重复的路径,使2条路径的好感度之和最大,求这个最大值。
1<=m,n<=50
题解:
对于求2条从[1,1]到[N,M]的路径,不重复的时候路径和最大
设f[I,J,K,L]表示[1,1]到[I,J],[1,1]到[KL]路径无重复的最大路径和
[x,y]由[x-1,y],[x,y-1]推来
则可得
F[I,j,k,l]=min{f[I-1,J,K-1,L],f[I-1,J,K,L-1],f[I,J-1,K-1,L],F[I,J-1,K,L-1]}+A[I,J]+A[K,L]
没到[n,m]前,[x,y]≠[k,l]
时间复杂度:O(N^4)
代码:
var
f:array [0..51,0..51,0..51,0..51] of longint;
a:array [0..51,0..51] of longint;
ans,i,j,k,l,n,m:longint;
function max(aa,bb:longint):longint;
begin
if aa>bb then exit(aa);
exit(bb);
end;
begin
assign(input,'message.in'); reset(input);
assign(output,'message.out'); rewrite(output);
readln(n,m);
for i:=1 to n do
begin
for j:=1 to m do read(a[i,j]);
readln;
end;
for i:=1 to n do
for j:=1 to m do
for k:=1 to n do
for l:=1 to m do
if ((i<>k) and (j<>l)) or ((i=k) and (i=n) and (j=l) and (j=m))
then begin
f[i,j,k,l]:=max(f[i,j,k,l],f[i,j-1,k-1,l]);
f[i,j,k,l]:=max(f[i,j,k,l],f[i,j-1,k,l-1]);
f[i,j,k,l]:=max(f[i,j,k,l],f[i-1,j,k-1,l]);
f[i,j,k,l]:=max(f[i,j,k,l],f[i-1,j,k,l-1]);
f[i,j,k,l]:=f[i,j,k,l]+a[i,j]+a[k,l];
end;
writeln(f[i,j,k,l]);
close(input); close(output);
end.