[ZJU 2112]Dynamic Rankings(树套树)

Status：2166705

2010-04-17 22:53:50

Accepted

2112

FPC

3770

23856

Skyprophet

【题目大意】：

给你一个数列，让你动态的进行操作使之可以实现以下操作：

1、修改一个位置上数的值

2、询问区间（i,j）上第k小的值是多少？

【题目分析】：

这个题就是树套树经典中的经典了。线段树套平衡树可以做，当然为了让程序更快，这道题就应该搞成树状数组套平衡树。树状数组以其常数、方便易写成为这道题的最佳解决方案。

当然，方法其实很简单。树状数组的区间意义并没有改变，只是每个节点上都是一棵平衡树。对于Q来说，二分答案就好。

突然想起来重新写这个问题是因为看到长郡的一套题，原来的树套树测了下巨慢无比~~

所以写了这个东西，下周还会做一些有关习题。尽请关注~

P.s.我正在努力让我有写完一道题写解题报告的习惯…………

【代码】：

program ZJU_2112; const inf=maxlongint; type node=record data,key,size,left,right,count:longint; end; var tree:array[0..50000*20] of node; root,a:array[0..50000] of longint; tot,n,m,tt,ttt,s,t,mid,i,x,y,k,tmp:longint; ch:char; procedure modify(p:longint); begin tree[p].size:=tree[tree[p].left].size+tree[tree[p].right].size+tree[p].count; end; procedure leftrotate(var p:longint); var t:longint; begin t:=tree[p].left; tree[p].left:=tree[t].right; tree[t].right:=p; modify(p); p:=t; modify(p); end; procedure rightrotate(var p:longint); var t:longint; begin t:=tree[p].right; tree[p].right:=tree[t].left; tree[t].left:=p; modify(p); p:=t; modify(p); end; procedure insert(var p:longint;x:longint); begin if p=0 then begin inc(tot); p:=tot; tree[p].left:=0; tree[p].right:=0; tree[p].data:=x; tree[p].key:=random(inf); tree[p].size:=1; tree[p].count:=1; end else begin if x=tree[p].data then inc(tree[p].count) else if x<tree[p].data then begin insert(tree[p].left,x); if tree[tree[p].left].key<tree[p].key then leftrotate(p); end else begin insert(tree[p].right,x); if tree[tree[p].right].key<tree[p].key then rightrotate(p); end; modify(p); end; end; procedure delete(var p:longint;x:longint); begin if p=0 then exit; if x<tree[p].data then delete(tree[p].left,x) else if x>tree[p].data then delete(tree[p].right,x) else begin if tree[p].count>1 then dec(tree[p].count) else if tree[p].left=0 then p:=tree[p].right else if tree[p].right=0 then p:=tree[p].left else if tree[tree[p].left].key<tree[tree[p].right].key then begin leftrotate(p); delete(tree[p].right,x); end else begin rightrotate(p); delete(tree[p].left,x); end; end; if p<>0 then modify(p); end; function rank(p,x:longint):longint; begin if p=0 then exit(0); if x<tree[p].data then exit(rank(tree[p].left,x)) else exit(rank(tree[p].right,x)+tree[p].count+tree[tree[p].left].size); end; function lowbit(x:longint):longint; begin exit(x and -x); end; procedure change(x,now:longint); begin while x<=n do begin insert(root[x],now); inc(x,lowbit(x)); end; end; procedure del(x,now:longint); begin while x<=n do begin delete(root[x],now); inc(x,lowbit(x)); end; end; function crank(x,y,now:longint):longint; var ans:longint; begin ans:=0; while y>0 do begin inc(ans,rank(root[y],now)); dec(y,lowbit(y)); end; while x>0 do begin dec(ans,rank(root[x],now)); dec(x,lowbit(x)); end; exit(ans); end; begin assign(input,'a.in'); assign(output,'a.out'); reset(input); rewrite(output); readln(tt); randomize; for ttt:=1 to tt do begin readln(n,m); tot:=0; fillchar(a,sizeof(a),0); fillchar(root,sizeof(root),0); fillchar(tree,sizeof(tree),0); for i:=1 to n do begin read(a[i]); change(i,a[i]); end; readln; for i:=1 to m do begin read(ch); case ch of 'C':begin readln(x,y); del(x,a[x]); a[x]:=y; change(x,a[x]); end; 'Q':begin readln(x,y,k); s:=0; t:=inf; while s<t do begin mid:=(s+t) shr 1; tmp:=crank(x-1,y,mid); if tmp<k then s:=mid+1 else t:=mid; end; writeln(s); end; end; end; end; close(input); close(output); end.

P.s. 173行，确实短了不少啊，而且还快了……唉~想想原来的那个200+的树套树就觉得悲剧……