Eason的博客

原创 Size Balanced Tree（SBT）平衡二叉树

const int N = 210005; const int INF=0x7FFFFFFF; struct SBT { int key,left,right,size; } tree[N]; int root,top; void init(){ root=top=0; } /////以下函数x参数带root void left_rot(int &x) { int y