pku3468 线段树lazy

线段树中有一个非常重要的东西叫做“lazy”也叫“yeptree”，（yep是2008年物理竞赛银牌保送sjtu联读班），因为yep和lazy在某种意义上是相似的？额，反正lazy是线段树中一个非常常用的东西。为什么管他叫lazy呢？就是每次在修改节点的sum值时，如果每次都下放到叶子节点，那么复杂度会变成nlogn，还不如直接暴力（树状数组还sqrt（n）呢，虽然我不会），而且对于某些修改一大段值的问题，用线段树动态维护的时候，如果找到了要修改的大区间，可以直接在这个大区间上标记，然后改掉sum值，等下次修改或者查询时再修改或者查询它的标记值，这样就可以做到每次查询或修改都为logn，大大节省了时间。

我也是很久没写线段树了，现在能用平衡树就平衡树，不知道怎么的。今天这道题本来很简单结果被我写了N节课一直wa，最后发现lazy之后算sum的时候有个细节没有处理好，额，我总是细节处理不好。但关键是我以前写带lazy的线段树很熟的，居然忘了。还有，现在写程序基本上都是100+，200+的，比noip那时候长多了。话说当时noip第三题标程才50行。

闲话不多说了，上题。

题目大意：

  给你N个数，Q个操作，操作有两种，‘Q a b ’是询问a~b这段数的和，‘C a b c’是把a~b这段数都加上c。

简略题解：

  就是线段树了，sum代表区间和，col代表染色，就是线段树最基本的操作了。

附程序（118行）：

program pku3468; var ctree:array[0..300000] of record l,r,mid,left,right:longint; sum,col:int64; end; a:array[0..100001] of int64; n,tot:longint; sum:int64; {-------------------------------------------} procedure build(u:longint); begin if ctree[u].l+1=ctree[u].r then begin ctree[u].sum:=a[ctree[u].l];exit; end; ctree[u].mid:=(ctree[u].l+ctree[u].r) div 2; inc(tot); ctree[u].left:=tot; ctree[tot].l:=ctree[u].l; ctree[tot].r:=ctree[u].mid; build(tot); inc(tot); ctree[u].right:=tot; ctree[tot].l:=ctree[u].mid; ctree[tot].r:=ctree[u].r; build(tot); ctree[u].sum:=ctree[ctree[u].left].sum+ctree[ctree[u].right].sum; end; {-------------------------------------------} procedure change(l,r,u:longint; p:int64); begin if ctree[u].l+1=ctree[u].r then begin inc(ctree[u].sum,p);exit; end; if ctree[u].col<>0 then begin ctree[u].sum:=ctree[u].sum+ctree[u].col*(ctree[u].r-ctree[u].l); inc(ctree[ctree[u].left].col,ctree[u].col); inc(ctree[ctree[u].right].col,ctree[u].col); ctree[u].col:=0; end; if (l=ctree[u].l) and (r=ctree[u].r) then begin inc(ctree[u].col,p); ctree[u].sum:=ctree[u].sum+ctree[u].col*(ctree[u].r-ctree[u].l); inc(ctree[ctree[u].left].col,ctree[u].col); inc(ctree[ctree[u].right].col,ctree[u].col); ctree[u].col:=0; exit; end else if l>=ctree[u].mid then change(l,r,ctree[u].right,p) else if r<=ctree[u].mid then change(l,r,ctree[u].left,p) else begin change(l,ctree[u].mid,ctree[u].left,p); change(ctree[u].mid,r,ctree[u].right,p); end; ctree[u].sum:=ctree[ctree[u].left].sum+ctree[ctree[u].right].sum; inc(ctree[u].sum,ctree[ctree[u].left].col*(ctree[u].mid-ctree[u].l)); inc(ctree[u].sum,ctree[ctree[u].right].col*(ctree[u].r-ctree[u].mid)); end; {-------------------------------------------} procedure find(l,r,u:longint); begin if ctree[u].l+1=ctree[u].r then begin inc(sum,ctree[u].sum+ctree[u].col);exit; end; if ctree[u].col<>0 then begin inc(sum,ctree[u].col*(r-l)); end; if (ctree[u].l=l) and (ctree[u].r=r) then begin inc(sum,ctree[u].sum);exit; end; if l>=ctree[u].mid then find(l,r,ctree[u].right) else if r<=ctree[u].mid then find(l,r,ctree[u].left) else begin find(l,ctree[u].mid,ctree[u].left); find(ctree[u].mid,r,ctree[u].right); end; end; {-------------------------------------------} procedure main; var i,q,l,r:longint; p:int64; t:char; begin readln(n,q); for i:=1 to n do read(a[i]); readln; ctree[1].l:=1;ctree[1].r:=n+1;tot:=1; build(1); for i:=1 to q do begin read(t); if t='Q' then begin sum:=0; readln(l,r); find(l,r+1,1); writeln(sum); end else if t='C' then begin readln(l,r,p); change(l,r+1,1,p); end; end; end; {-------------------------------------------} begin main; end.