HDU 2665 Kth number

HDU 2665

题意就是区间第k大数 是主席树的板子题 也算是开启了我主席树的入门篇章

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
const int MAX_N = 100025;
int n,m,k,cnt,root[MAX_N],x,y,arr[MAX_N];
struct node{int l,r,sum;}T[MAX_N*40];
vector<int > vt;
int getid(int x)
{
    return lower_bound(vt.begin(),vt.end(),x)-vt.begin()+1;
}

void update(int l,int r,int &x,int y,int pos)
{
    T[++cnt] = T[y],T[cnt].sum++,x= cnt;
    if(l==r) return ;
    int mid = (l+r)>>1;
    if(pos<=mid)  update(l,mid,T[x].l,T[y].l,pos);
    else update(mid+1,r,T[x].r,T[y].r,pos);
}
int query(int l,int r,int x,int y,int k)
{
    if(l==r) return l;
    int mid = (l+r)>>1;
    int sum = T[T[y].l].sum - T[T[x].l].sum;
    if(sum>=k) return query(l,mid,T[x].l,T[y].l,k);
    else return query(mid+1,r,T[x].r,T[y].r,k-sum);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        vector<int > vt_;
        swap(vt,vt_);
        cnt = 0;
        memset(root,0,sizeof(root));
        scanf("%d%d",&n,&m);
        //dbg2(n,m);
        for(int i = 1;i<=n;i++) scanf("%d",&arr[i]),vt.push_back(arr[i]);
        sort(vt.begin(),vt.end()),vt.erase(unique(vt.begin(),vt.end()),vt.end());
        for(int i = 1;i<=n;++i) update(1,n,root[i],root[i-1],getid(arr[i]));
        for(int i = 1;i<=m;++i)
        {
            scanf("%d%d%d",&x,&y,&k);
            printf("%d\n",vt[query(1,n,root[x-1],root[y],k)-1]);
        }
    }
    return 0;
}