[BZOJ3039] 玉蟾宫

传送门

http://www.lydsy.com/JudgeOnline/problem.php?id=3039

题目大意

最大全0子矩阵

题解

单调栈+DP
注意啊,坑爹的数据里有一组有空格QAQ

var
 l,r,dp,w:array[-1..1005,-1..1005]of longint;
 t:array[0..1005]of longint;
 i,j,k:longint;
 n,m:longint;
 a:char;
 ans,len:longint;
function max(a,b:longint):Longint;
begin
 if a>b then exit(a) else exit(b);
end;

begin
 readln(n,m);
 While Eoln Do Readln;
 for i:=1 to n do begin
  for j:=1 to m do
   begin read(a); if a='R' then w[i,j]:=1 else w[i,j]:=0; read(a); end;
  readln;
 end;
 ans:=0;
 for i:=1 to n do begin
  for j:=1 to m do
   if (w[i,j]=0)
   then dp[i,j]:=dp[i-1,j]+1
   else dp[i,j]:=0;
  t[0]:=1; t[1]:=1;
  for j:=2 to m+1 do begin
   len:=t[0];
   for k:=len downto 1 do
    if dp[i,j]<dp[i,t[k]]
    then begin r[i,t[k]]:=j-1; dec(t[0]); end
    else break;
   inc(t[0]); t[t[0]]:=j;
  end;
  t[0]:=1; t[1]:=m;
  for j:=m-1 downto 0 do begin
   len:=t[0];
   for k:=len downto 1 do
    if dp[i,j]<dp[i,t[k]]
    then begin l[i,t[k]]:=j+1; dec(t[0]); end
    else break;
   inc(t[0]); t[t[0]]:=j;
  end;
  for j:=1 to m do
   ans:=max(ans,(r[i,j]-l[i,j]+1)*dp[i,j]);
 end;
 writeln(ans*3);
end.