NOI2005维修数列

剧恶心的splay……

为什么在bzoj上是超时，在自己的电脑上测的是栈溢出……

const maxn=500010;
      maxc=11000;
var
  n,m,i,j,y,root,x,posi,t,head:longint;
  ch:char;
  op:array[0..maxn] of boolean;
  l,r,a,next,c,mc,s,ma,mb,sum:array[0..maxn] of longint;
function max(x,y:longint):longint;
 begin
  if x>y then exit(x) else exit(y);
 end;
procedure update(x:longint);
 var ls,rs:longint;
   begin
    ls:=l[x];rs:=r[x];
    sum[x]:=sum[ls]+sum[rs]+a[x];
    ma[x]:=max(ma[ls],sum[ls]+ma[rs]+a[x]);
    mb[x]:=max(mb[rs],sum[rs]+mb[ls]+a[x]);
    mc[x]:=max(mc[ls],mc[rs]);
    mc[x]:=max(mc[x],mb[ls]+ma[rs]+a[x]);
    s[x]:=s[ls]+s[rs]+1;
   end;
procedure r_rotate(var x:longint);
 var y:longint;
  begin
   y:=l[x];l[x]:=r[y];r[y]:=x;update(x);x:=y;
  end;
procedure l_rotate(var x:longint);
 var y:longint;
  begin
   y:=r[x];r[x]:=l[y];l[y]:=x;update(x);x:=y;
  end;
procedure put(x,y:longint;flag:boolean);
 var tmp:longint;
   begin
    if x=0 then exit;
    if flag then
     begin
      tmp:=l[x];l[x]:=r[x];r[x]:=tmp;
      tmp:=ma[x];ma[x]:=mb[x];mb[x]:=tmp;
      op[x]:=not op[x];
     end;
    if y<1001 then
     begin
      c[x]:=y;a[x]:=y;sum[x]:=s[x]*y;
      mc[x]:=max(0,sum[x]);
      ma[x]:=mc[x];mb[x]:=mc[x];
      if mc[x]=0 then mc[x]:=y;
     end;
   end;
procedure splay(var x:longint;y:longint);
 var tmp:longint;
   begin
    put(l[x],c[x],op[x]);put(r[x],c[x],op[x]);
    op[x]:=false;c[x]:=maxc;tmp:=s[l[x]]+1;
    if y=tmp then exit;
    if y>tmp then
      begin
       splay(r[x],y-tmp);l_rotate(x);
      end
    else
      begin
       splay(l[x],y);r_rotate(x);
      end;
   end;
procedure build(var x:longint;lx,rx:longint);
 begin
  if lx>rx then exit;
  x:=(lx+rx)>>1;
  build(l[x],lx,x-1);
  build(r[x],x+1,rx);
  update(x);
 end;
procedure release(x:longint);
 begin
  if x=0 then exit;
  next[x]:=head;head:=x;
  release(l[x]);release(r[x]);
 end;
procedure init;
 begin
  readln(n,m);root:=0;
  fillchar(c,sizeof(c),1);
  a[1]:=-10000;a[n+2]:=-10000;mc[0]:=-10000;
  for i:=2 to n+1 do read(a[i]);readln;
  head:=n+3;
  for i:=head+1 to maxn do next[i-1]:=i;
  build(root,1,n+2);
 end;
procedure main;
 begin
  for m:=1 to m do
   begin
    read(ch);
    case ch of
    'I':begin
         while ch<>' ' do read(ch);
         read(posi,t);
         splay(root,posi+2);
         for t:=1 to t do
           begin
            read(y);x:=head;head:=next[head];
            a[x]:=y;l[x]:=l[root];l[root]:=x;
            r[x]:=0;c[x]:=maxc;op[x]:=false;
            update(x);
           end;
         update(root);
        end;
    'D':begin
         while ch<>' ' do read(ch);
         read(posi,t);
         splay(root,posi);
         splay(root,posi+t+1);
         release(r[l[root]]);r[l[root]]:=0;
         update(l[root]);update(root);
        end;
    'M':begin
         read(ch);read(ch);
         case ch of
         'K':begin
              while ch<>' ' do read(ch);
              read(posi,t,x);
              splay(root,posi);
              splay(root,posi+t+1);
              put(r[l[root]],x,false);
              update(l[root]);update(root);
             end;
         'X':writeln(mc[root]);
         end;
        end;
    'R':begin
         while ch<>' ' do read(ch);
         read(posi,t);
         splay(root,posi);
         splay(root,posi+t+1);
         put(r[l[root]],maxc,true);
         update(l[root]);update(root);
        end;
    'G':begin
         while ch<>' ' do read(ch);
         read(posi,t);
         splay(root,posi);
         splay(root,posi+t+1);
         update(root);
         writeln(sum[r[l[root]]]);
        end;
    end;
    readln;
   end;
  end;
begin
  init;
  main;
end.       

声亦香的题解：http://blog.sina.com.cn/s/blog_86942b1401016dhb.html

可是他的两个程序交上去也是一样的结果……