POJ 2104 K-th Number(整体二分)

K-th Number

Time Limit: 20000MS		Memory Limit: 65536K
Total Submissions: 67933		Accepted: 23979
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.

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.

思路：
这题之前用主席树写过一次，用整体二分也可以做。
数值的范围在-1e9~1e9,二分取一个mid,判断哪些
询问会落在左区间，哪些会落在右区间，递归处理，
知道l==r既是答案。整体二分的大概思想就是把
所有的询问一起二分。
代码：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e6+10;
struct node
{
    int val,id;
}a[maxn];
struct Node
{
    int x,y,k,id,cnt;
}q[maxn],b[maxn];
int ans[maxn],n,Q,bit[maxn];
bool cmp(const node &A,const node &B){return A.val<B.val;}
void cal(int L,int R,int l,int mid)
{
    int x=1,y=n,ans;
    while(x<=y)
    {
        int mid=(x+y)/2;
        if(a[mid].val>=l) ans=mid,y=mid-1;
        else x=mid+1;
    }
    y=ans;
    for(int i=y;i<=n&&a[i].val<=mid;i++)
        for(int j=a[i].id;j<=n;j+=j&-j) bit[j]++;
    for(int i=L;i<=R;i++)
    {
        q[i].cnt=0;
        for(int j=q[i].y;j>0;j-=j&-j) q[i].cnt+=bit[j];
        for(int j=q[i].x-1;j>0;j-=j&-j) q[i].cnt-=bit[j];
    }
    for(int i=y;i<=n&&a[i].val<=mid;i++)
        for(int j=a[i].id;j<=n;j+=j&-j) bit[j]--;
}
void work(int L,int R,int l,int r)
{
    if(l==r)
    {
        for(int i=L;i<=R;i++)
            ans[q[i].id]=l;
        return;
    }
    int mid=l+(r-l)/2;
    cal(L,R,l,mid);
    int now1=L,now2=R;
    for(int i=L;i<=R;i++)
    {
        if(q[i].cnt>=q[i].k)
            b[now1++]=q[i];
        else
            q[i].k-=q[i].cnt,b[now2--]=q[i];
    }
    for(int i=L;i<=R;i++)
        q[i]=b[i];
    if(now1!=L) work(L,now1-1,l,mid);
    if(now2!=R) work(now2+1,R,mid+1,r);
}
int main()
{
    scanf("%d%d",&n,&Q);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i].val);
        a[i].id=i;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=Q;i++)
    {
        scanf("%d%d%d",&q[i].x,&q[i].y,&q[i].k);
        q[i].id=i;
    }
    int limt=1e9;
    work(1,Q,-limt,limt);
    for(int i=1;i<=Q;i++) printf("%d\n",ans[i]);
    return 0;
}