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 109 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.
题目大意
求区间[l,r]中第k小的值
主席树裸题，我现在也只能做裸题
1 #include<cstdio>
2 #include<algorithm>
3 #include<cstdlib>
4 using namespace std;
5 const int N=1000;
6 int a[N],b[N],ls[N],rs[N],sum[N],root[N];
7 int t,sz,n,m;
8 void build(int l,int r,int x,int &y,int v){
9 y=++sz;
10 ls[y]=ls[x]; rs[y]=rs[x];
11 sum[y]=sum[x]+1;
12 if (l==r) return;
13 int mid=(l+r)>>1;
14 if (v>mid) build(mid+1,r,rs[x],rs[y],v);
15 else build(l,mid,ls[x],ls[y],v);
16 }
17
18 int query(int L,int R,int w){
19 int l=1,r=t,mid=(l+r)>>1;
20 int x=root[L-1],y=root[R];
21 while (l!=r){
22 if (sum[ls[y]]-sum[ls[x]]>=w){r=mid;x=ls[x];y=ls[y];mid=(l+r)>>1;}
23 else {w-=sum[ls[y]];w+=sum[ls[x]];l=mid+1;x=rs[x];y=rs[y];mid=(l+r)>>1;}
24 }
25 return l;
26 }
27
28 int main(){
29 scanf("%d%d",&n,&m);
30 for (int i=1;i<=n;i++){scanf("%d",&a[i]);b[i]=a[i];}
31 sort(b+1,b+n+1);
32 t=unique(b+1,b+n+1)-b-1;
33 for (int i=1;i<=n;i++){
34 int w=lower_bound(b+1,b+t+1,a[i])-b;
35 build(1,t,root[i-1],root[i],w);
36 }
37 int l,r,w;
38 for (int i=1;i<=m;i++){
39 scanf("%d%d%d",&l,&r,&w);
40 printf("%d\n",b[query(l,r,w)]);
41 }
42 }