K-th Number
Time Limit: 20000MS | Memory Limit: 65536K | |
Total Submissions:63368 | Accepted: 22321 | |
Case Time Limit: 2000MS |
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.
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 9 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).
The second line contains n different integer numbers not exceeding 10 9 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.
每个节点保存对应区间的升序序列。对于每次查询,若第k大的值是x
则区间内小于等于x的个数一定大于等于k,因此可以二分查找x的值
代码:
#include<cstdio>
#include<algorithm>
#include<vector>
#include<functional>
using namespace std;
#define ll long long
#define lson rt<<1
#define rson rt<<1|1
const int maxn=100007;
int a[maxn];
vector<int>P[maxn<<2];
void Push_up(int rt)
{
int a=0,b=0,L1=P[lson].size(),L2=P[rson].size();
while(a!=L1||b!=L2)
{
if(a==L1) P[rt].push_back(P[rson][b++]);
else if(b==L2) P[rt].push_back(P[lson][a++]);
else
{
if(P[lson][a]<P[rson][b])
P[rt].push_back(P[lson][a++]);
else P[rt].push_back(P[rson][b++]);
}
}
//merge(P[lson].begin(),P[lson].end(),P[rson].begin(),P[rson].end(),P[rt].begin());
}
void build(int l,int r,int rt)
{
if(l==r)
{
P[rt].push_back(a[l]);
return;
}
int m=(l+r)>>1;
build(l,m,lson);
build(m+1,r,rson);
Push_up(rt);
}
int query(int L,int R,int C,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
return upper_bound(P[rt].begin(),P[rt].end(),C)-P[rt].begin();
}
int m=(l+r)>>1;
int ans=0;
if(L<=m)ans+=query(L,R,C,l,m,lson);
if(R>m) ans+=query(L,R,C,m+1,r,rson);
return ans;
}
int main()
{
int n,m,i,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
build(1,n,1);
sort(a+1,a+n+1);
while(m--)
{
int x,y,k;scanf("%d%d%d",&x,&y,&k);
int l=0,r=n+1;
while(r-l>1)
{
int m=(l+r)>>1;
int ans=query(x,y,a[m],1,n,1);
if(ans>=k) r=m;
else l=m;
}
printf("%d\n",a[r]);
}
return 0;
}