划分树学习 poj 2104

开始学习划分树······

虽然还不是很懂····大概的思路还是看懂了···先排序，然后对没排序的数按大小分开到两边····num_left记录自己左边有多少分到左边用于查询····

按照网上的题目大概敲了下···还有些不懂的地方···尤其是查询···还不是很懂···下次在看懂 

下面是这题的代码··

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int const tcnt = 100100;
struct node
{
    int l,r;
}tree[tcnt*4];
int a[tcnt],deep[20][tcnt],num_left[20][tcnt];
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])
        {
            num_left[d][i]++;
            deep[d+1][lpos++] = deep[d][i];
        }
        if(deep[d][i] > a[Mid])
        deep[d+1][rpos++] = deep[d][i];
        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];
    }
    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(l==r)return deep[d][l];
    int s,ss;
    if(l==tree[id].l)
        ss = 0;
    else
        ss = num_left[d][l-1];
    s = num_left[d][r] - ss;
    if(s >= val )
        return find_rank(id<<1,tree[id].l+ss,tree[id].l+ss+s-1,d+1,val);
    else
    {
        int Mid = (tree[id].l+tree[id].r)>>1;
        int bb = l - tree[id].l - ss;
        int b = r - l + 1 - s;
        return find_rank(id<<1|1,Mid+bb+1,Mid+bb+b,d+1,val-s);
    }
}
int main()
{
    int n,m,l,r,val;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1;i<=n;i++)
        scanf("%d",&deep[1][i]),a[i] = deep[1][i];
        sort(a+1,a+n+1);
        build(1,1,n,1);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&l,&r,&val);
            printf("%d\n",find_rank(1,l,r,1,val));
        }
    }
}