zoukankan      html  css  js  c++  java
  • C++之路进阶——poj2104(K-th Number)

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

    题目大意:给你一段序列,求给定区间[u,v]中第k小的值

    代码:

        

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<algorithm>
     4 #define maxn 1000100 
     5 
     6 using namespace std;
     7 
     8 int n,m,sz;
     9 int hash[maxn],a[maxn],root[maxn],ls[maxn*80],rs[maxn*80],sum[maxn*80];
    10 
    11 void updata(int l,int r,int x,int &y,int v)
    12     {
    13        y=++sz;    
    14        sum[y]=sum[x]+1;        
    15        if (l==r) return;
    16        ls[y]=ls[x];
    17        rs[y]=rs[x];
    18        int mid=(l+r)>>1;
    19        if (v<=mid) updata(l,mid,ls[x],ls[y],v);
    20               else updata(mid+1,r,rs[x],rs[y],v);      
    21     }
    22     
    23 int que(int L,int R,int K)
    24     {
    25       int l=1,r=n,mid,x,y;
    26       x=root[L-1];
    27       y=root[R];    
    28       while (l!=r)    
    29          {
    30          mid=(l+r)>>1;    
    31           if (K<=sum[ls[y]]-sum[ls[x]])
    32             {
    33                 x=ls[x];
    34                 y=ls[y];
    35                 r=mid;
    36                 }
    37             else
    38              {    
    39                 K-=(sum[ls[y]]-sum[ls[x]]);
    40                  x=rs[x];
    41                  y=rs[y];
    42                  l=mid+1;
    43                      }        
    44          }
    45        return l;     
    46     }    
    47     
    48 int main()
    49    {
    50         scanf("%d%d",&n,&m);    
    51         for (int i=1;i<=n;i++)    
    52            scanf("%d",&a[i]),hash[i]=a[i];
    53         sort(hash+1,hash+n+1);
    54      for (int i=1;i<=n;i++)      
    55         {    
    56           int w=lower_bound(hash+1,hash+n+1,a[i])-hash;
    57           updata(1,n,root[i-1],root[i],w);
    58         }
    59     for (int i=1;i<=m;i++)
    60        {
    61          int l,r,v;    
    62             scanf("%d%d%d",&l,&r,&v);
    63             printf("%d
    ",hash[que(l,r,v)]);
    64        }
    65     return 0;           
    66    }
    67    
  • 相关阅读:
    form2js的使用(续BootstrapTable)
    input限定文件上传类型:Microsoft Office MIME types
    Zookeeper环境搭建
    Zookeeper一致性协议——ZAB
    Zookeeper简介
    IOC容器加载流程
    Spring Bean 生命周期
    Spring Framework 5 模块组成、体系结构、整体架构
    什么是 IoC?什么是 DI ? 他们之间有什么关系?
    【MySQL实战45讲】索引部分整理
  • 原文地址:https://www.cnblogs.com/grhyxzc/p/5144161.html
Copyright © 2011-2022 走看看