HDU 4251 The Famous ICPC Team Again
来源:互联网 发布:mac电脑声音很大 编辑:程序博客网 时间:2024/05/29 13:54
The Famous ICPC Team Again
Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 786 Accepted Submission(s): 378
Problem Description
When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of contest problems for their daily training. When they decided to take training, Mr. B would choose one of them from the problem set. All the problems in the problem set had been sorted by their time of publish. Each time Prof. S, their coach, would tell them to choose one problem published within a particular time interval. That is to say, if problems had been sorted in a line, each time they would choose one of them from a specified segment of the line.
Moreover, when collecting the problems, Mr. B had also known an estimation of each problem’s difficultness. When he was asked to choose a problem, if he chose the easiest one, Mr. G would complain that “Hey, what a trivial problem!”; if he chose the hardest one, Mr. M would grumble that it took too much time to finish it. To address this dilemma, Mr. B decided to take the one with the medium difficulty. Therefore, he needed a way to know the median number in the given interval of the sequence.
Moreover, when collecting the problems, Mr. B had also known an estimation of each problem’s difficultness. When he was asked to choose a problem, if he chose the easiest one, Mr. G would complain that “Hey, what a trivial problem!”; if he chose the hardest one, Mr. M would grumble that it took too much time to finish it. To address this dilemma, Mr. B decided to take the one with the medium difficulty. Therefore, he needed a way to know the median number in the given interval of the sequence.
Input
For each test case, the first line contains a single integer n (1 <= n <= 100,000) indicating the total number of problems. The second line contains n integers xi (0 <= xi <= 1,000,000,000), separated by single space, denoting the difficultness of each problem, already sorted by publish time. The next line contains a single integer m (1 <= m <= 100,000), specifying number of queries. Then m lines follow, each line contains a pair of integers, A and B (1 <= A <= B <= n), denoting that Mr. B needed to choose a problem between positions A and B (inclusively, positions are counted from 1). It is guaranteed that the number of items between A and B is odd.
Output
For each query, output a single line containing an integer that denotes the difficultness of the problem that Mr. B should choose.
Sample Input
55 3 2 4 131 32 43 5510 6 4 8 231 32 43 5
Sample Output
Case 1:332Case 2:664
Source
Fudan Local Programming Contest 2012
解题思路:划分树模板题,求区间中位数
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int Maxn=100010;int tree[20][Maxn];int sorted[Maxn];int toleft[20][Maxn];void build(int l,int r,int dep){if(l==r)return ;int mid=(l+r)>>1;int same=mid-l+1;for(int i=l;i<=r;i++)if(tree[dep][i]<sorted[mid])same--;int lpos=l;int rpos=mid+1;for(int i=l;i<=r;i++){if(tree[dep][i]<sorted[mid])tree[dep+1][lpos++]=tree[dep][i];else if(tree[dep][i]==sorted[mid]&&same>0)tree[dep+1][lpos++]=tree[dep][i],same--;elsetree[dep+1][rpos++]=tree[dep][i];toleft[dep][i]=toleft[dep][l-1]+lpos-l;}build(l,mid,dep+1);build(mid+1,r,dep+1);}int query(int L,int R,int l,int r,int dep,int k){if(l==r)return tree[dep][l];int mid=(L+R)>>1;int cnt=toleft[dep][r]-toleft[dep][l-1];if(cnt>=k){int newl=L+toleft[dep][l-1]-toleft[dep][L-1];int newr=newl+cnt-1;return query(L,mid,newl,newr,dep+1,k);}else{int newr=r+toleft[dep][R]-toleft[dep][r];int newl=newr-(r-l-cnt);return query(mid+1,R,newl,newr,dep+1,k-cnt);}}int main(){int n,m,a,b,ncase=1;freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);while(~scanf("%d",&n)){memset(tree,0,sizeof(tree));for(int i=1;i<=n;i++)scanf("%d",&tree[0][i]),sorted[i]=tree[0][i];sort(sorted+1,sorted+1+n);build(1,n,0);scanf("%d",&m);printf("Case %d:\n",ncase++);while(m--){scanf("%d%d",&a,&b);int k=(b-a+1)/2+1;printf("%d\n",query(1,n,a,b,0,k));}}return 0;}
0 0
- Hdu 4251 The Famous ICPC Team Again
- hdu 4251 The Famous ICPC Team Again
- HDU 4251 The Famous ICPC Team Again
- hdu 4251 The Famous ICPC Team Again--划分树
- hdu 4251 The Famous ICPC Team Again (划分数)
- hdu 4251 The Famous ICPC Team Again(划分树裸题)
- HDU 4251 The Famous ICPC Team Again 简单主席树
- HDU:4251 The Famous ICPC Team Again(划分树)
- hdu 4251 The Famous ICPC Team Again(划分树)
- hdu 4251 The Famous ICPC Team Again(划分树)
- HDU 4251 The Famous ICPC Team Again (划分树)
- HDU 4251The Famous ICPC Team Again 划分树
- hdu 4251 The Famous ICPC Team Again(划分树)
- HDOJ 4251 The Famous ICPC Team Again
- HDU 4251-The Famous ICPC Team Again(划分树-区间中位数)
- HDU 4251 The Famous ICPC Team Again 划分树 区间第K大
- hdoj_4251The Famous ICPC Team Again
- HDU4251-The Famous ICPC Team Again(划分树)
- cocos2dx android版本移植时的Error format not a string literal and no format arguments解决方案
- Cocos2 场景切换方式
- typedef struct与struct的区别
- mysql安装,配置,远程连接
- UE正则表达式语法
- HDU 4251 The Famous ICPC Team Again
- Android之rild进程启动源码分析(个人认为写的比较完善的一个)
- Android中针对<meta-data>怎么来使用
- eclipse安装m2e
- C语言 ## __VA_ARGS__ 宏
- js 字符串转化成数字
- jQuery插件开发全解析
- Mongodb2.6配置文件
- struts应用