poj1179polygon

只要注意负负得正，所以要保存最大和最小值

但我一开始区间起始位置枚举没有写到2*n-1，使得后面的小区间没有办法枚举到，然后WA了

痛定思痛！

program polygon;
var n,l,i,j,k,t:longint;
    maxx:int64;
    ch:char;
    f,g:array[0..150,0..150]of longint;
    b:array[0..150]of char;
    a:array[0..150]of longint;
function max(a,b:longint):longint;
begin
 if a<b then max:=b else max:=a;
end;
function min(a,b:longint):longint;
begin
 if a<b then min:=a else min:=b;
end;
begin
 readln(n);
 for i:=1 to 2*n do
  for j:=1 to 2*n do
   begin
    f[i,j]:=-maxlongint;
    g[i,j]:=maxlongint;
   end;


 for i:=1 to 2*n do
  if odd(i) then
   begin
    read(ch);
    b[(i+1) div 2]:=ch;
    b[n+(i+1) div 2]:=ch;
    read(ch);
   end
  else
   begin
    read(a[i div 2]);
    a[n+i div 2]:=a[i div 2];
    f[i div 2,i div 2]:=a[i div 2];
    f[n+i div 2,n+i div 2]:=a[i div 2];
    g[i div 2,i div 2]:=a[i div 2];
    g[n+i div 2,n+i div 2]:=a[i div 2];
    read(ch);
   end;


 maxx:=-maxlongint;
 for l:=2 to n do
  for i:=1 to 2*n-1 do
   begin
    j:=i+l-1;
    if j<=2*n then
     for k:=i to j-1 do
      if b[k+1]='t' then
       begin
        f[i,j]:=max(f[i,j],f[i,k]+f[k+1,j]);
        g[i,j]:=min(g[i,j],g[i,k]+g[k+1,j]);
       end
      else
       begin
        f[i,j]:=max(f[i,j],max(f[i,k]*f[k+1,j],g[i,k]*g[k+1,j]));
        g[i,j]:=min(g[i,j],min(g[i,k]*f[k+1,j],f[i,k]*g[k+1,j]));
       end;
    if maxx<f[i,i+n-1] then maxx:=f[i,i+n-1];
   end;
 writeln(maxx);
 for i:=1 to n do
  if f[i,i+n-1]=maxx then write(i,' ');
end.