1166 矩阵取数游戏 求解

const
maxnum=1000000000;
type
arr=array[1..4] of longint;
var
i,j,k,l,m,n,kk:longint;
ans,temp1,temp2:arr;
data:array[1..100,1..100] of longint;
f:array[0..100,0..100,1..4] of longint;
procedure max(a,b:arr);
var
k:longint;
temp:arr;
begin
for k:=4 downto 1 do
begin
if a[k]>b[k] then
begin
temp:=a;
break;
end
else
if a[k]<b[k] then
begin
temp:=b;
break;
end;
temp:=a;
end;
for k:=1 to 4 do f[i,j][k]:=temp[k];
end;
procedure add(a,i,j:longint; var temp:arr);
var
k:longint;
begin
fillchar(temp,sizeof(temp),0);
temp[1]:=(f[i,j][1]+a) shl 1;
for k:=2 to 4 do
begin
temp[k]:=temp[k-1] div maxnum+f[i,j][k] shl 1;
temp[k-1]:=temp[k-1] mod maxnum;
end;
end;
procedure addans(i,j:longint);
var
k:longint;
begin
for k:=1 to 4 do
begin
ans[k]:=ans[k]+f[i,j][k];
if ans[k]>=maxnum then
begin
ans[k+1]:=ans[k+1]+ans[k] div maxnum;
ans[k]:=ans[k] mod maxnum;
end;
end;
end;
procedure print;
var
j,k,num:longint;
begin
num:=maxnum div 10;
for i:=4 downto 1 do
if ans[i]<>0 then
begin
write(ans[i]);
break;
end;
if (i=1) and (ans[i]=0) then write('0');
for k:=i-1 downto 1 do
begin
for j:=1 to 8 do
begin
if ans[k] div num=0 then write('0');
num:=num div 10;
end;
write(ans[k]);
num:=maxnum div 10;
end;
writeln;
end;
begin
readln(n,m);
for i:=1 to n do
begin
for j:=1 to m do
read(data[i,j]);
readln;
end;
fillchar(ans,sizeof(ans),0);
for k:=1 to n do
begin
fillchar(f,sizeof(f),0);
for l:=1 to m do
for i:=1 to m-l+1 do
begin
j:=i+l-1;
add(data[k,i],i+1,j,temp1);
add(data[k,j],i,j-1,temp2);
max(temp1,temp2);
end;
addans(1,m);
end;
print;
end.

起床第一件事就是盖楼~~~~~~~~~~~~~~~~~~~~