[PKU 2104]K-th Number(树套树版)

【题目描述】：

就比ZJU_2112少了个操作，没有change操作。

【题目分析】：

这题有比树套树更好的方法，就是归并树，我会在之后的题解中说说。

这题方法跟ZJU_2112一样，二分答案就好。这题有可能是负数，所以注意二分的情况（如果直接二分答案的话就要枚举0到inf*2）。然后检查mid-inf。因为如果二分到了负数会死在里面。

当然因为没有change，就可以排个序，直接枚举数组上的东西。

我的代码在ranklist里排倒第五……

【代码】：

program PKU_2104; const inf=1000000000; type node=record data,key,size,left,right,count:longint; end; var tree:array[0..100000*20] of node; root,a:array[0..100000] of longint; tot,n,m,i,x,y,k,tmp:longint; s,t,mid:dword; procedure qsort(s,t:longint); var i,j,k,key:longint; begin i:=s; j:=t; key:=a[(s+t) div 2]; repeat while a[i]<key do inc(i); while a[j]>key do dec(j); if i<=j then begin k:=a[i]; a[i]:=a[j]; a[j]:=k; inc(i); dec(j); end; until i>j; if s<j then qsort(s,j); if i<t then qsort(i,t); end; 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; 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); randomize; readln(n,m); tot:=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; qsort(1,n); for i:=1 to m do begin readln(x,y,k); s:=1; t:=n; while s<t do begin mid:=(s+t) shr 1; tmp:=crank(x-1,y,a[mid]); if tmp<k then s:=mid+1 else t:=mid; end; writeln(a[s]); end; close(input); close(output); end.