陈启峰SizeBalancedTree官方源码.pdfVIP

{$inline on} program CQF_SBT; const maxn=2000000; var key,s,left,right,a,b:array[0..maxn] of longint; tt,q:longint; procedure init; begin readln(q); for q:=1 to q do readln(a[q],b[q]); end; procedure work; var t,k:longint; procedure right_rotate(var t:longint);inline; begin k:=left[t]; left[t]:=right[k]; right[k]:=t; s[k]:=s[t]; s[t]:=s[left[t]]+s[right[t]]+1; t:=k; end; procedure left_rotate(var t:longint);inline; begin k:=right[t]; right[t]:=left[k]; left[k]:=t; s[k]:=s[t]; s[t