poj2104 Kth-Number

Description

You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked to write a new data structure that would be able to return quickly k-th order statistics in the array segment.
That is, given an array a[1...n] of different integer numbers, your program must answer a series of questions Q(i, j, k) in the form: "What would be the k-th number in a[i...j] segment, if this segment was sorted?"

For example, consider the array a = (1, 5, 2, 6, 3, 7, 4). Let the question be Q(2, 5, 3). The segment a[2...5] is (5, 2, 6, 3). If we sort this segment, we get (2, 3, 5, 6), the third number is 5, and therefore the answer to the question is 5.

Input

The first line of the input file contains n --- the size of the array, and m --- the number of questions to answer (1 <= n <= 100 000, 1 <= m <= 5 000).

The second line contains n different integer numbers not exceeding 10⁹ by their absolute values --- the array for which the answers should be given.

The following m lines contain question descriptions, each description consists of three numbers: i, j, and k (1 <= i <= j <= n, 1 <= k <= j - i + 1) and represents the question Q(i, j, k).

Output

For each question output the answer to it --- the k-th number in sorted a[i...j] segment.

Sample Input

7 3
1 5 2 6 3 7 4
2 5 3
4 4 1
1 7 3

Sample Output

5
6
3

Hint

This problem has huge input,so please use c-style input(scanf,printf),or you may got time limit exceed.

题意：给你一个大小为n的序列和m个询问，每次询问求[L,R]区间第k大的值。

正解：主席树或整体二分

以前一直觉得主席树是一个很高深的东西，自己写了以后才知道原来主席树代码极短。。

建n颗值域线段树，第i颗线段树保存1-i对应区间的结点个数，如根结点为1-maxa的个数，左右儿子分别二分得到。

那么，这颗主席树就能满足前缀和的性质，在查询时，只需将第r颗树上的贡献减去第l-1颗树上的贡献就好。查询贡献时，判断当前两结点之差与k的关系。如果当前差<=k，那么就查询左子树，否则查询右子树，查询到叶子结点时就得出答案。。

还有一个问题，如果真的直接开n颗线段树肯定会MLE，那么我们可以利用可持久化技术，每次插入一棵线段树时只加入与之前的树不同的一条链，其他的结点不变，那么我们每次插入的空间复杂度为O(logN)，总复杂度为O(NlogN)，可以接受。

不多说了，看代码吧。。

 //It is made by wfj_2048~
 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cstdlib>
 #include <cstdio>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <stack>
 #include <map>
 #include <set>
 #define inf 1<<30
 #define il inline
 #define RG register
 #define ll long long
 #define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)

 using namespace std;

 int root[],a[],num[],hash[],s[],ls[],rs[],n,m,sz,tot;

 il int gi(){
     RG int x=,q=; RG char ch=getchar();
     while ((ch<'' || ch>'') && ch!='-') ch=getchar(); if (ch=='-') q=,ch=getchar();
     while (ch>='' && ch<='') x=x*+ch-,ch=getchar(); return q ? -x : x;
 }

 il void insert(RG int l,RG int r,RG int x,RG int &y,RG int k){
     y=++sz,s[y]=s[x]+; if (l==r) return; ls[y]=ls[x],rs[y]=rs[x]; RG int mid=(l+r)>>;
     if (k<=mid) insert(l,mid,ls[x],ls[y],k); else insert(mid+,r,rs[x],rs[y],k); return;
 }

 il int ask(RG int l,RG int r,RG int x,RG int y,RG int k){
     while (l<r){
     RG int mid=(l+r)>>;
     if (s[ls[y]]-s[ls[x]]>=k) r=mid,x=ls[x],y=ls[y];
     else l=mid+,k-=s[ls[y]]-s[ls[x]],x=rs[x],y=rs[y];
     }
     return l;
 }

 il void work(){
     n=gi(),m=gi(); for (RG int i=;i<=n;++i) num[i]=a[i]=gi(); sort(num+,num+n+);
     hash[++tot]=num[]; for (RG int i=;i<=n;++i) if (num[i]!=num[i-]) hash[++tot]=num[i];
     for (RG int i=;i<=n;++i) insert(,tot,root[i-],root[i],lower_bound(hash+,hash+tot+,a[i])-hash);
     for (RG int i=;i<=m;++i){ RG int l=gi(),r=gi(),k=gi(); printf("%d\n",hash[ask(,tot,root[l-],root[r],k)]); }
     return;
 }

 int main(){
     File("kth");
     work();
     return ;
 }