ac1169.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1169;
const
  maxn=1000001;
var
  h,l,r:array[0..maxn]of longint;
  n,i:longint;
  ans,t:int64;
begin
  repeat
    read(n);
    for i:=1 to n do
      read(h[i]);
    h[n+1]:=0;

    for i:=1 to n do begin
      l[i]:=i;
      while (h[i]<=h[l[i]-1]) do l[i]:=l[l[i]-1];
    end;

    for i:=n downto 1 do begin
      r[i]:=i;
      while (h[i]<=h[r[i]+1]) do r[i]:=r[r[i]+1];
    end;

    ans:=0;
    for i:=1 to n do begin
      t:=int64(h[i])*(r[i]-l[i]+1);
      if t>ans then ans:=t;
    end;
    writeln(ans);
  until seekeof;
end.