zoukankan      html  css  js  c++  java
  • K-th Number(主席树)

    K-th Number
    Time Limit: 20000MS   Memory Limit: 65536K
    Total Submissions: 76404   Accepted: 27483
    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.

    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.

    Source

    Northeastern Europe 2004, Northern Subregion
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 #include <vector>
     6 using namespace std;
     7 const int maxn=1e5+5;
     8 int n,m,x,y,k,cnt;
     9 int a[maxn],root[maxn];
    10 vector<int> vec;
    11 struct Node{ int l,r,sum; }A[maxn*40];
    12 int getid(int x) { return lower_bound(vec.begin(),vec.end(),x)-vec.begin()+1; }
    13 
    14 void updata(int l,int r,int &now,int pre,int pos){
    15     A[++cnt]=A[pre]; now=cnt, A[now].sum++;
    16     if(l==r) return;
    17     int mid=l+r>>1;
    18     if(mid>=pos) updata(l,mid,A[now].l,A[pre].l,pos);
    19     else updata(mid+1,r,A[now].r,A[pre].r,pos);
    20 }
    21 
    22 int query(int l,int r,int x,int y,int pos){
    23     if(l==r) return l;
    24     int mid=l+r>>1;
    25     int m=A[A[y].l].sum-A[A[x].l].sum;
    26     if(m>=pos) return query(l,mid,A[x].l,A[y].l,pos);
    27     else return query(mid+1,r,A[x].r,A[y].r,pos-m);
    28 }
    29 
    30 int main(){
    31     ios::sync_with_stdio(false);
    32     cin>>n>>m;
    33     for(int i=1;i<=n;i++) cin>>a[i],vec.push_back(a[i]);
    34     sort(vec.begin(),vec.end()); vec.erase(unique(vec.begin(),vec.end()),vec.end());
    35     for(int i=1;i<=n;i++) updata(1,n,root[i],root[i-1],getid(a[i]));
    36     for(int i=1;i<=m;i++){
    37         cin>>x>>y>>k;
    38         cout << vec[query(1,n,root[x-1],root[y],k)-1] << endl;
    39     }
    40     return 0;
    41 }
    View Code
  • 相关阅读:
    XmlSerializer .NET 序列化、反序列化
    XmlSerializer .NET 序列化、反序列化
    XmlSerializer .NET 序列化、反序列化
    细数那些你可能不知道的国产数据库
    Python爬虫入门教程 13-100 斗图啦表情包多线程爬取
    基于超大规模集群的本地存储系统优化
    BI分析工具深度测评:FineBI vs Tableau
    Python爬虫入门教程 12-100 半次元COS图爬取
    celery 配置
    Java基础之int和Integer有什么区别
  • 原文地址:https://www.cnblogs.com/qq-1585047819/p/11405664.html
Copyright © 2011-2022 走看看