Billboard(线段树)
来源:互联网 发布:淘宝的kindle 官方重封 编辑:程序博客网 时间:2024/06/07 00:58
贴海报呀贴海报
http://acm.hdu.edu.cn/showproblem.php?pid=2795
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17388 Accepted Submission(s): 7338
Problem Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming competitions, changes in the dining room menu, and other important information.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
On September 1, the billboard was empty. One by one, the announcements started being put on the billboard.
Each announcement is a stripe of paper of unit height. More specifically, the i-th announcement is a rectangle of size 1 * wi.
When someone puts a new announcement on the billboard, she would always choose the topmost possible position for the announcement. Among all possible topmost positions she would always choose the leftmost one.
If there is no valid location for a new announcement, it is not put on the billboard (that's why some programming contests have no participants from this university).
Given the sizes of the billboard and the announcements, your task is to find the numbers of rows in which the announcements are placed.
Input
There are multiple cases (no more than 40 cases).
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
The first line of the input file contains three integer numbers, h, w, and n (1 <= h,w <= 10^9; 1 <= n <= 200,000) - the dimensions of the billboard and the number of announcements.
Each of the next n lines contains an integer number wi (1 <= wi <= 10^9) - the width of i-th announcement.
Output
For each announcement (in the order they are given in the input file) output one number - the number of the row in which this announcement is placed. Rows are numbered from 1 to h, starting with the top row. If an announcement can't be put on the billboard, output "-1" for this announcement.
Sample Input
3 5 524333
Sample Output
1213-1
#include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <map> #include <set> #include <stack> #include <string> #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 #define LL long long using namespace std; const int SIZE=2e5+10; const int maxn=500000; const int Mod=1e8; int sum[SIZE<<2]; void pushup(int rt){ sum[rt]=max(sum[rt<<1],sum[rt<<1|1]); } void build(int c,int l,int r,int rt){ fill(sum,sum+(200000<<2),c); } void update(int x,int l,int r,int rt){ if(l==r){ sum[rt]-=x; return; } int m=(l+r)>>1; if(sum[rt<<1]>=x)update(x,lson);//优先放在上方,区间映射左边对上方 else update(x,rson); pushup(rt); } int query(int x,int l,int r,int rt){ if(l==r){ return l; } int m=(l+r)>>1; if(sum[rt<<1]>=x)return query(x,lson); else return query(x,rson); } int main() { int h,w,n,x; while(scanf("%d%d%d",&h,&w,&n)!=EOF){ build(w,1,h,1); int y=min(h,n); for(int i=0;i<n;i++){ scanf("%d",&x); if(sum[1]<x){//无解的情况 printf("-1\n"); continue; } printf("%d\n",query(x,1,y,1));//一定存在解 update(x,1,y,1); } } return 0; }
0 0
- Billboard(线段树)
- Billboard(线段树)
- Billboard(线段树)
- Billboard(线段树)
- Billboard(线段树)
- hdu billboard (线段树)
- hdu Billboard (线段树)
- hdu2795 Billboard(线段树)
- HDU2795 Billboard(线段树)
- HDU2795:Billboard(线段树)
- HDU Billboard(线段树)
- Billboard (线段树,多维)
- hdu 2795 Billboard(线段树)
- hdu - 2795 - Billboard(线段树)
- hdu 2795 Billboard(线段树)
- [ACM] hdu 2795 Billboard (线段树)
- HDU 2795 Billboard(线段树)
- 线段树-hdu2795 Billboard(贴海报)
- 在vs2010中编译log4cxx-0.10.0详细方法(从下载、编译、解决错误详细介绍)
- JSP九大内置对象和四大作用域及其作用
- pagination in angularjs
- java调用存储过程
- Web jquery ajax,EL遍历 js刷新 jquery遍历json数组填充表格 等等随笔
- Billboard(线段树)
- 关于Spring中自定义限定器的使用
- mysql explain用法
- random walk
- ios: XcodeColors插件输出颜色不变
- Future的使用
- 最速下降法/steepest descent,牛顿法/newton,共轭方向法/conjugate direction,共轭梯度法/conjugate gradient 及其他
- error LNK2005: _DllMain@12 已经在 MSVCRTD.lib(dllmain.obj) 中定义
- MyBatis的like模糊查询