hdu 4006 The kth great number 线段树

最新推荐文章于 2017-09-07 19:01:15 发布

joafelnglfds

最新推荐文章于 2017-09-07 19:01:15 发布

阅读量597

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/is_cp/article/details/45032917

版权

数据结构专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Description

Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the number written by Xiao Ming is too much, Xiao Bao is feeling giddy. Now, try to help Xiao Bao.

Input

There are several test cases. For each test case, the first line of input contains two positive integer n, k. Then n lines follow. If Xiao Ming choose to write down a number, there will be an " I" followed by a number that Xiao Ming will write down. If Xiao Ming choose to ask Xiao Bao, there will be a "Q", then you need to output the kth great number.

Output

The output consists of one integer representing the largest number of islands that all lie on one line.

Sample Input

Sample Output

    
    
     
      1
2

     
     3 
     
     分析：
     
     第一次在比赛写线段树，自己太差了，wa了之后以为自己理解错了（这个题目也没说输入数的范围，我以为错在这里）也没多想就放弃了，其实是忽略了一个地方，那就是输入的数可重复。
     
     建树之后，sum[]记录区间里出现的数，然后就是简单的插入查询了。
     
     不过，更简单的是优先队列的方法。
     
     代码：
     
     
     
     
      
      #include
        
        
         
         
#include
         
         
          
          
#include
          
          
           
           
#include
           
           
            
            
#include
            
            
              #include 
             
               #include 
              
                #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define N 1000000 using namespace std; int sum[N<<2+5],val[N<<2+5]; int n,cnt,k,ans; void PushUp(int rt) { sum[rt]=sum[rt<<1]+sum[rt<<1|1]; } void build(int l,int r,int rt) { if(l==r) { sum[rt]=0; val[rt]=++cnt; // printf("val[%d]=%d\n",rt,val[rt]); return; } int m=(l+r)>>1; build(lson); build(rson); PushUp(rt); } void update(int l,int r,int rt,int aim) { if(l==r) { sum[rt]++; // 写下的数可重复 return; } int m=(l+r)>>1; if(aim<=m) update(lson,aim); else update(rson,aim); PushUp(rt); } void query(int l,int r,int rt,int num) { if(l==r) { ans=val[rt]; return; } int m=(l+r)>>1; if(sum[rt<<1]>=num) query(lson,num); else query(rson,num-sum[rt<<1]); } int main() { while(~scanf("%d%d",&n,&k)) { cnt=0; build(1,N,1); // cout<<"------"<