HDU 2852 KiKi's K-Number (树状数组+二分)
来源:互联网 发布:sql分页查询语句join 编辑:程序博客网 时间:2024/06/09 19:59
KiKi's K-Number
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4144 Accepted Submission(s): 1866
Problem Description
For the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the container is to support the three operations.
Push: Push a given element e to container
Pop: Pop element of a given e from container
Query: Given two elements a and k, query the kth larger number which greater than a in container;
Although Kiki is very intelligent, she can not think of how to do it, can you help her to solve this problem?
Push: Push a given element e to container
Pop: Pop element of a given e from container
Query: Given two elements a and k, query the kth larger number which greater than a in container;
Although Kiki is very intelligent, she can not think of how to do it, can you help her to solve this problem?
Input
Input some groups of test data ,each test data the first number is an integer m (1 <= m <100000), means that the number of operation to do. The next m lines, each line will be an integer p at the beginning, p which has three values:
If p is 0, then there will be an integer e (0 <e <100000), means press element e into Container.
If p is 1, then there will be an integer e (0 <e <100000), indicated that delete the element e from the container
If p is 2, then there will be two integers a and k (0 <a <100000, 0 <k <10000),means the inquiries, the element is greater than a, and the k-th larger number.
If p is 0, then there will be an integer e (0 <e <100000), means press element e into Container.
If p is 1, then there will be an integer e (0 <e <100000), indicated that delete the element e from the container
If p is 2, then there will be two integers a and k (0 <a <100000, 0 <k <10000),means the inquiries, the element is greater than a, and the k-th larger number.
Output
For each deletion, if you want to delete the element which does not exist, the output "No Elment!". For each query, output the suitable answers in line .if the number does not exist, the output "Not Find!".
Sample Input
50 51 20 62 3 22 8 170 20 20 42 1 12 1 22 1 32 1 4
Sample Output
No Elment!6Not Find!224Not Find!
Source
2009 Multi-University Training Contest 4 - Host by HDU
从a+1到100000二分。
#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>using namespace std;#define LL long longconst int N = 100000;int sum[N+3];int num[N+3];int lowbit(int x){ return x&-x;}void add(int x,int y){ for(int i=x;i<=N;i+=lowbit(i)) { sum[i]+=y; }}int query(int x){ int ans=0; for(int i=x;i>=1;i-=lowbit(i)) { ans+=sum[i]; } return ans;}void work(int a,int k){ if(query(N)-query(a)<k) { printf("Not Find!\n"); return; } int l=a+1,r=N; int mid=(l+r)>>1; while(l!=r)//注意二分的使用。 { int now=query(mid)-query(a); if(now>=k) { r=mid; }// else if(now==k)// {// while(num[mid]==0)// {// mid--;// }// printf("%d\n",mid);// return ;// } else {// while(num[mid]==0)// {// mid++;// } l=mid+1; } mid=(l+r)>>1; } printf("%d\n",r); }int main(){ int n,p,e,a,k; while(~scanf("%d",&n)) { memset(sum,0,sizeof sum); memset(num,0,sizeof num); while(n--) { scanf("%d",&p); if(p==0) { scanf("%d",&e); num[e]++; add(e,1); } else if(p==1) { scanf("%d",&e); if(num[e]==0) printf("No Elment!\n"); else num[e]--,add(e,-1); } else if(p==2) { scanf("%d%d",&a,&k); work(a,k); } } }}
阅读全文
0 0
- hdu 2852 KiKi's K-Number(树状数组+二分)
- HDU 2852 KiKi's K-Number(树状数组+二分)
- HDU 2852 KiKi's K-Number(树状数组+二分)
- HDU 2852 KiKi's K-Number (树状数组+二分)
- hdu 2852 KiKi's K-Number 二分+树状数组
- [树状数组]hdu 2852 KiKi's K-Number# +二分查找。
- HDU 2852 KiKi's K-Number (树状数组+二分)
- HDU 2852 KiKi's K-Number 二分+树状数组
- HDU 2852 KiKi's K-Number【 树状数组 二分 】
- HDU KiKi's K-Number (树状数组+二分查找)
- hdoj 2852 KiKi's K-Number(树状数组+二分)
- HDU 2852——KiKi's K-Number(树状数组+二分查找, 第k大)
- hdu 2852 KiKi's K-Number(树状数组)
- hdu 2852 KiKi's K-Number(树状数组)
- HDU 2852 KiKi's K-Number(树状数组)
- hdu 2852 KiKi's K-Number(树状数组)
- HDU 2852 KiKi's K-Number *(树状数组)
- KiKi's K-Number(树状数组+二分)
- C#版SQLite的备份和还原
- Android JNI对象与Java对象的绑定
- mac os 下安装好Mysql后无法连接(强行修改密码)
- springCloud(三续)
- 饿了么移动APP的架构演进
- HDU 2852 KiKi's K-Number (树状数组+二分)
- 分享些电子书,有需要的自行下载
- 基础概念之内存对齐
- 寻找无序数组的中位数
- 变量,包
- Unity3D之iTween动画插件应用
- Java短信实现
- [STM32]--关于移植STemwin所遇到的问题记录(1)
- 1到10的阶乘和