(树状数组)KiKi's K-Number -- HDOJ
来源:互联网 发布:美工对电脑配置的要求 编辑:程序博客网 时间:2024/06/05 01:08
KiKi’s K-Number
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 229 Accepted Submission(s): 94
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?
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
/* 1、插入一个数,add(x,1)在x位置插入一个1,相当于x位置多了一个数 代表x这个数出现了几次 2、sum(i) 代表 小于等于i的个数有多少个,那么找一个数是否存在,就 今天可以用sum(i) - sum(i-1) 来判断i出现的次数 删除一个数用add(x,-1)即可 3、先找到sum(i),也就是小于等于i的个数,那么第y+sum(i)个数就是比 i大的第y个数*/#include<stdio.h>#include<iostream>#include<string.h>using namespace std;const int maxn=100010;int c[maxn];int n;int lowbit(int x){ return x&(-x);}void add(int i,int val){ while(i<=maxn) { c[i]+=val; i+=lowbit(i); }}int sum(int i){ int s=0; while(i>0) { s+=c[i]; i-=lowbit(i); } return s;}//求第k个数int getkth2(int k){ int l=0,r=maxn,mid,f; while(l<r-1) { mid=(l+r)>>1; f=sum(mid); if(f>=k) r=mid; else l=mid; } return r;}int main(){// freopen("in.txt","r",stdin); int m; while(scanf("%d",&m) != EOF) { memset(c,0,sizeof(c)); int op,x,y; for(int i=1;i<=m;i++) { scanf("%d",&op); if(op == 0) { scanf("%d",&x); //x位置加一,相当于,插入了一个值为x 的数 //sum(i)就代表小于等于i的个数 add(x,1); } else if(op == 1) { scanf("%d",&x); if(sum(x) - sum(x-1) == 0) cout << "No Elment!"<<endl; else add(x,-1);// } else if(op == 2) { scanf("%d %d",&x,&y); if(sum(maxn-1) - sum(x) < y) // 大于x的个数 cout << "Not Find!"<<endl; else { printf("%d\n",getkth2(y+sum(x))); } } } } return 0;}
- hdoj 2852 KiKi's K-Number(树状数组+二分)
- (树状数组)KiKi's K-Number -- HDOJ
- HDOJ 2852 KiKi's K-Number(树状数组)
- HDOJ 2852 KiKi's K-Number (树状数组+二分查找)
- hdu 2852 KiKi's K-Number(树状数组+二分)
- hdu 2852 KiKi's K-Number(树状数组)
- KiKi's K-Number(树状数组+二分)
- HDU 2852 KiKi's K-Number(树状数组+二分)
- HDU KiKi's K-Number (树状数组+二分查找)
- HDU2852 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 树状数组
- vi的使用--使用vi查找和替换
- MySQL5.6的10053,CBO如何选择执行计划
- hive中null值得查询
- 正则表达式中的"^"这个符号的一些思考
- IOS移动操作系统开发入门介绍(书本教学式)
- (树状数组)KiKi's K-Number -- HDOJ
- 七、输入/输出流-- 七、输入/输出流--基于字符串的流---basic_istringstream 模板
- 极简版nosql
- 前端解决跨域问题的8种方案
- ajax跨域的问题
- layoutAnimation
- 不规范的英文名字编程首字母大写
- 【HDU 1068】Girls and Boys(二分图)
- 数串 -- JAVA 算法学习