【主席树模板题||划分树模板题】B - K-th Number POJ - 2104

B - K-th Number POJ - 2104

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 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.

主席树

Status	Accepted
Time	1766ms
Memory	24944kB
Length	1307
Lang	G++
Submitted	2018-11-26 20:58:22
Shared
RemoteRunId	19521416

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
int T[maxn],L[maxn*20],R[maxn*20],sum[maxn*20];
int a[maxn],b[maxn];
int tot;

void build(int &rt,int l,int r)
{
    rt=++tot;
    sum[rt]=0;
    int mid=(l+r)/2;
    if(l==r) return ;
    build(L[rt],l,mid);
    build(R[rt],mid+1,r);
}

void update(int &rt,int l,int r,int pre,int x)
{
    rt=++tot;
    L[rt]=L[pre];
    R[rt]=R[pre];
    int mid=(l+r)/2;
    sum[rt]=sum[pre]+1;
    if(l==r) return ;
    if(x<=mid) update(L[rt],l,mid,L[pre],x);
    else update(R[rt],mid+1,r,R[pre],x);
}

int query(int l,int r,int s,int e,int k)
{
    if(l==r) return l;
    int mid=(l+r)/2;
    int res=sum[L[e]]-sum[L[s]];
    if(res>=k) query(l,mid,L[s],L[e],k);
    else query(mid+1,r,R[s],R[e],k-res);
}

int main()
{
    tot=0;
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        b[i]=a[i];
    }
    sort(b+1,b+n+1);
    int num=unique(b+1,b+n+1)-b-1;
    build(T[0],1,num);
    for(int i=1;i<=n;i++)
    {
        update(T[i],1,num,T[i-1],lower_bound(b+1,b+num+1,a[i])-b);
    }
    while(m--)
    {
        int ql,qr,k;
        scanf("%d%d%d",&ql,&qr,&k);
        int ans=query(1,num,T[ql-1],T[qr],k);
        printf("%d\n",b[ans]);
    }
    return 0;
}

 

划分树模板

Status	Accepted
Time	1329ms
Memory	14732kB
Length	1768
Lang	G++
Submitted	2018-11-26 18:02:37
Shared
RemoteRunId	19520646

 

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <iomanip>
#include <algorithm>
using namespace std;
const int maxn=100005;

struct node
{
    int num[maxn];
    int cnt[maxn];
}tree[20];
int a[maxn];

void build(int deep,int l,int r)
{
    if(l==r) return;
    int mid=(l+r)/2;
    int key=a[mid];
    int scnt=mid-l+1;
    for(int i=l;i<=r;i++)
    {
        if(tree[deep].num[i]<key) scnt--;
    }
    int left=l-1,right=mid,cnt=0;
    for(int i=l;i<=r;i++)
    {
        int num=tree[deep].num[i];
        if(num<key||(num==key&&scnt))
        {
            if(num==key) scnt--;
            ++cnt;
            tree[deep+1].num[++left]=num;
        }
        else tree[deep+1].num[++right]=num;
        tree[deep].cnt[i]=cnt;
    }
    build(deep+1,l,mid);
    build(deep+1,mid+1,r);
}

int query(int deep,int l,int r,int ql,int qr,int k)
{
    if(l==r) return tree[deep].num[l];
    int mid=(l+r)/2;
    int left=0,sum_left=tree[deep].cnt[qr];
    if(l!=ql)
    {
        left=tree[deep].cnt[ql-1];
        sum_left-=left;
    }
    if(sum_left>=k)
    {
        int newleft=left+l;
        int newright=newleft+sum_left-1;
        return query(deep+1,l,mid,newleft,newright,k);
    }
    else
    {
        int a=ql-left-l;
        int b=qr-ql-sum_left;
        int newleft=mid+1+a;
        int newright=newleft+b;
        return query(deep+1,mid+1,r,newleft,newright,k-sum_left);
    }
}


int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        tree[0].num[i]=a[i];
    }
    sort(a+1,a+n+1);
    build(0,1,n);
    while(m--)
    {
        int ql,qr,k;
        scanf("%d%d%d",&ql,&qr,&k);
        printf("%d\n",query(0,1,n,ql,qr,k));
    }
    return 0;
}