xiaoyu1_1的专栏

http://blog.youkuaiyun.com/libing923/article/details/9724631 #include #include using namespace std; const int N=100001; //点的个数 const int M=18; //建树的深度 int arr[N],sorted[N],val[M][N],toleft[M]