划分树 hdu 2665

大概已经学会如何使用划分树···但还不够熟练···争取以后能灵活使用划分树···

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;

int const NCNT = 100010;
struct node
{
    int l,r;
}tree[NCNT*4];
int deep[20][NCNT],num_left[20][NCNT];
int a[NCNT];
void build(int id,int l,int r,int d)
{
    tree[id].l = l;
    tree[id].r = r;
    if(l==r) return;
    int Mid = (l+r)>>1,lsame = Mid-l+1;
    for(int i=l;i<=r;i++)
        if(deep[d][i]<a[Mid])
            lsame--;
    int lpos = l,rpos = Mid + 1;
    for(int i=l;i<=r;i++)
    {
        if(i==l)
            num_left[d][i] = 0;
        else
            num_left[d][i] = num_left[d][i-1];
        if(deep[d][i]==a[Mid])
        {
            if(lsame>0)
                lsame--,num_left[d][i]++,deep[d+1][lpos++] = deep[d][i];
            else
                deep[d+1][rpos++] = deep[d][i];
        }
        else if(deep[d][i] < a[Mid])
        num_left[d][i]++,deep[d+1][lpos++] = deep[d][i];
        else
        deep[d+1][rpos++] = deep[d][i];
    }
    build(id<<1,l,Mid,d+1);
    build(id<<1|1,Mid+1,r,d+1);
}

int find_rank(int id,int l,int r,int d,int val)
{
    if(tree[id].l==tree[id].r) return deep[d][tree[id].l];
    int ll = l==tree[id].l ? 0 : num_left[d][l-1];
    int ls = num_left[d][r] - ll;
    int rr = l-tree[id].l-ll;
    int rs = r-l+1-ls;
    int Mid = (tree[id].l+tree[id].r)>>1;
    if(val <= ls)
    return find_rank(id<<1,tree[id].l+ll,tree[id].l+ll+ls-1,d+1,val);
    else
    return find_rank(id<<1|1,Mid+rr+1,Mid+rr+rs,d+1,val-ls);
}

bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int t,l,r,k,n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),deep[1][i] = a[i];
        sort(a+1,a+n+1);
        build(1,1,n,1);
//        for(int i = 1;i<10;i++){
//        for(int j = 1;j<=n;j++)
//        printf("%d ",deep[i][j]);printf("\n");}
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d%d",&l,&r,&k);
            printf("%d\n",find_rank(1,l,r,1,k));
        }
    }
}