HDOJ 4417 Super Mario
来源:互联网 发布:水溶性润滑液 知乎 编辑:程序博客网 时间:2024/05/15 08:53
划分树+二分
Super Mario
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2625 Accepted Submission(s): 1274
Problem Description
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to the boss’s castle as a line (the length is n), on every integer point i there is a brick on height hi. Now the question is how many bricks in [L, R] Mario can hit if the maximal height he can jump is H.
Input
The first line follows an integer T, the number of test data.
For each test data:
The first line contains two integers n, m (1 <= n <=10^5, 1 <= m <= 10^5), n is the length of the road, m is the number of queries.
Next line contains n integers, the height of each brick, the range is [0, 1000000000].
Next m lines, each line contains three integers L, R,H.( 0 <= L <= R < n 0 <= H <= 1000000000.)
For each test data:
The first line contains two integers n, m (1 <= n <=10^5, 1 <= m <= 10^5), n is the length of the road, m is the number of queries.
Next line contains n integers, the height of each brick, the range is [0, 1000000000].
Next m lines, each line contains three integers L, R,H.( 0 <= L <= R < n 0 <= H <= 1000000000.)
Output
For each case, output "Case X: " (X is the case number starting from 1) followed by m lines, each line contains an integer. The ith integer is the number of bricks Mario can hit for the ith query.
Sample Input
110 100 5 2 7 5 4 3 8 7 7 2 8 63 5 01 3 11 9 40 1 03 5 55 5 14 6 31 5 75 7 3
Sample Output
Case 1:4003120151
Source
2012 ACM/ICPC Asia Regional Hangzhou Online
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=100100;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)/2; int same=mid-l+1; for(int i=l;i<=r;i++) if(tree[dep][i]<sorted[mid]) same--; int lpos=l,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--; } else tree[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)/2; 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 n,m;int bin(int l,int r,int h){ int low=1,high=r-l+1,mid,ans=0; while(low<=high) { mid=(low+high)/2; int temp=query(1,n,l,r,0,mid); if(h>=temp) { ans=mid; low=mid+1; } else high=mid-1; } return ans;}int main(){ int T_T,cas=1; scanf("%d",&T_T); while(T_T--) { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",sorted+i); tree[0][i]=sorted[i]; } sort(sorted+1,sorted+1+n); build(1,n,0); int l,r,h; printf("Case %d:\n",cas++); while(m--) { scanf("%d%d%d",&l,&r,&h); l++,r++; printf("%d\n",bin(l,r,h)); } } return 0;}
1 0
- HDOJ 4417: Super Mario
- HDOJ 4417 Super Mario
- 【线段树】 HDOJ 4417 Super Mario
- hdoj 4417 Super Mario 【树状数组 + 思维】
- hdu-4417-Super Mario
- 4417 hdu Super Mario
- hdu 4417 Super Mario
- HDU 4417 Super Mario
- hdu 4417 Super Mario
- hdu 4417 Super Mario
- HDU 4417 Super Mario
- hdu 4417 Super Mario
- HDU 4417 Super Mario
- HDU 4417 Super Mario
- HDU 4417 Super Mario
- HDU 4417 Super Mario
- HDU 4417 Super Mario
- HDU 4417 Super Mario
- nvidia笔记本双显卡怎么安装驱动
- 题目1018:统计同成绩学生人数 题目10
- JSONKit使用中的注意事项
- WingIDE 设置支持中文
- 一个北理普通硕士(不牛不渣)的求职总结
- HDOJ 4417 Super Mario
- Tian Ji -- The Horse Racing(贪心)
- C#多线程学习(1-6)
- 动画客户端的分辨率设计
- java学习记录
- 题目1431:Sort 题目11
- 从表到里学习JVM实现
- VS2013 c++ 修改默认活动解决方案平台
- 克服程序拖延症