另需注意应枚举hh和(mm或nn)

因为hh较小

这样复杂度为 O(h^2m^2n)或 O(h^2n^2m)

为之奈何？

var

i,j,k,li,lj,lk,h,n,m,max,x:longint;

a:array[0..32,0..32,0..50,0..50,0..50,0..50] of longint;

begin

readln(h);read(m);read(n);

for k:=1 to h do

for i:=1 to m do

for j:=1 to n do begin

read(x);

a[k,1,i,1,j,1]:=x;

if a[k,1,i,1,j,1]>max then max:=a[k,1,i,1,j,1];

end;

for lk:=1 to h do

for k:=1 to h-lk+1 do

for li:=1 to m do

for i:=1 to m-li+1 do

for lj:=1 to n do

for j:=1 to n-lj+1 do begin

a[k,lk,i,li,j,lj]:=a[k,lk,i,li,j,lj-1]+a[k,lk,i,li,j+lj-1,1];

if a[k,lk,i,li,j,lj]>max then max:=a[k,lk,i,li,j,lj];

end;

writeln(max);

end.