记录编号	22042	评测结果	AAAAAAAAAA
题目名称	牛宫	最终得分	100
用户昵称	belong.zmx	是否通过	通过
代码语言	Pascal	运行时间	2.066 s
提交时间	2010-11-16 19:16:19	内存使用	0.42 MiB

var
n,m,i,j,k,p,ans:longint;
sum,b:array[0..200]of int64;
a:array[0..200,0..200]of int64;
x:int64;


function calc(i,j,x,y:longint):int64;
begin
calc:=a[x,y]-a[x,j-1]-a[i-1,y]+a[i-1,j-1];
end;

begin
assign(input,'long.in'); reset(input);
assign(output,'long.out'); rewrite(output);
readln(n,m);
for i:=1 to n do
for j:=1 to m do
   begin
    read(x);
    a[i,j]:=a[i-1,j]+a[i,j-1]-a[i-1,j-1]+x;
   end;
for i:=1 to m do
for j:=i to m do
   begin
    for k:=1 to n do sum[k]:=calc(1,i,k,j);
    for k:=1 to n do
     if sum[k]>sum[k-1] then
      begin
       b[k]:=k;
       for p:=0 to b[k-1] do
        if sum[p]<sum[k] then
         begin
          b[k]:=p;
          if (k-p)*(j-i+1)>ans then ans:=(k-p)*(j-i+1);
          break;
         end;
       end
      else begin
       b[k]:=k;
       for p:=b[k-1] to k-1 do
        if sum[p]<sum[k] then
         begin
          b[k]:=p;
          if (k-p)*(j-i+1)>ans then ans:=(k-p)*(j-i+1);
          break;
         end;
            end;
   end;
writeln(ans);
close(input); close(output);
end.