划分树

#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define Deep 20
#define Maxn 100000
int sorte[Maxn];
int tree[Deep][Maxn];
int toLeft[Deep][Maxn];
void Build(int deep , int left , int right)//建树
{
    if(left == right)
        return ;
    int mid = (left+right)>>1;
    int flag = mid - left + 1;
    for(int i = left ; i <= right ; i ++)
        if(tree[deep][i] < sorte[mid])
            flag --;
    int Nextleft = left , Nextright = mid+1;
    for(int i = left ; i <= right ; i ++)
    {
        if(i == left)
            toLeft[deep][i] = 0;
        else
            toLeft[deep][i] = toLeft[deep][i-1];
        if(tree[deep][i]<sorte[mid] ||(tree[deep][i] == sorte[mid] && flag > 0))
        {
            tree[deep+1][Nextleft++] = tree[deep][i];
            toLeft[deep][i]++;
            if(tree[deep][i] == sorte[mid])
                flag -- ;
        }
        else
            tree[deep+1][Nextright++] = tree[deep][i];
    }
    Build(deep+1,left,mid);
    Build(deep+1,mid+1,right);
}
int Query(int deep , int ql , int qr, int left , int right , int k)//查询
{
    int mid = (left + right) >> 1;
    if(ql == qr)
        return tree[deep][ql];
    int lef;
    int toLef;
    if(ql == left)
        lef = 0 , toLef = toLeft[deep][qr];
    else
        lef = toLeft[deep][ql-1],toLef = toLeft[deep][qr] - lef;
    if( k <= toLef)
    {
        int newLeft = left + lef;
        int newRight = left + lef + toLef - 1;
        return Query(deep+1,newLeft,newRight,left,mid,k);
    }
    else
    {
        int newLeft = mid + ql - left - lef + 1;
        int newRight = mid + qr - left  -toLef - lef + 1;
        return Query(deep+1,newLeft,newRight,mid+1,right,k-toLef);
    }
}
int main(void)
{
    int n,m;
    cin>>n>>m;
    for(int i = 1 ; i <= n ; i ++)
    {
        scanf("%d",&tree[0][i]);
        sorte[i] = tree[0][i];
    }
    sort(sorte+1,sorte+1+n);
    Build(0,1,n);
    int ql , qr , k;
    while(m --)
    {
        scanf("%d %d %d",&ql,&qr,&k);
        printf("%d\n",Query(0,ql,qr,1,n,k));
    }
}

这是我见过解释最详细的划分树：

https://blog.csdn.net/akatsuki__itachi/article/details/80030929

致敬！