[SPOJ 726]Promotion(平衡树)

这几天恶心代码敲得太多了，太恶心了，不写了，决定开始刷刷水题~~

P.s.推荐Cai0715解题表格（澳淄cai0715神牛~~）

下面言归正传

【题目大意】：

一共有n天，每一天有一些数，你要把这些数加入一个队列当中，然后每天结束后从中选出最大的和最小的数，相减累加到ans中，将这两个数从平衡树中删除~输出ans~~

【题目分析】：

真没啥好分析的，1A掉~就是个平衡树是吧……

方法其实有很多，最大最小堆也可以，分段哈希也可以~很多很多方法~

总之这题不难了，当基础代码训练了啊……

唯一一个容易悲剧的情况就是ans要开成int64，否则会WA到死（我猜的~）……

【代码】：

program SPOJ_726; const inf=50000000; type node=record data,left,right,key,count:longint; end; var ans:int64; tree:array[0..10000000] of node; n,tot,root,nn,x,y,i,j:longint; procedure leftrotate(var p:longint); var t:longint; begin t:=tree[p].left; tree[p].left:=tree[t].right; tree[t].right:=p; p:=t; end; procedure rightrotate(var p:longint); var t:longint; begin t:=tree[p].right; tree[p].right:=tree[t].left; tree[t].left:=p; p:=t; end; procedure insert(var p:longint;x:longint); begin if p=0 then begin inc(tot); p:=tot; tree[p].data:=x; tree[p].left:=0; tree[p].right:=0; tree[p].key:=random(inf); 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; end; end; function getmin(var p:longint):longint; begin if tree[p].left=0 then exit(tree[p].data) else exit(getmin(tree[p].left)); end; function getmax(var p:longint):longint; begin if tree[p].right=0 then exit(tree[p].data) else exit(getmax(tree[p].right)); end; procedure delete(var p:longint;x:longint); begin 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; end; begin assign(input,'a.in'); assign(output,'a.out'); reset(input); rewrite(output); randomize; readln(n); ans:=0; root:=0; for i:=1 to n do begin read(nn); for j:=1 to nn do begin read(x); insert(root,x); end; readln; x:=getmax(root); y:=getmin(root); ans:=ans+(x-y); delete(root,x); delete(root,y); end; writeln(ans); close(input); close(output); end.