HDOJ 题目2795 Billboard(线段树单点更新)
来源:互联网 发布:淘宝入驻条件及费用 编辑:程序博客网 时间:2024/06/08 07:06
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12813 Accepted Submission(s): 5579
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
Author
hhanger@zju
Source
HDOJ 2009 Summer Exercise(5)
Recommend
lcy | We have carefully selected several similar problems for you: 1698 1542 1828 1540 1255
ac代码
#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)int node[202000<<2],h,w,n;void pushup(int tr){node[tr]=max(node[tr<<1],node[tr<<1|1]);}void build_tr(int l,int r,int tr){if(l==r){node[tr]=w;return;}int mid=(l+r)>>1;build_tr(l,mid,tr<<1);build_tr(mid+1,r,tr<<1|1);pushup(tr);}void query(int val,int l,int r,int tr){if(node[tr]<val){printf("-1\n");return;}if(l==r){node[tr]-=val;printf("%d\n",l);return;}int mid=(l+r)>>1;if(val<=node[tr<<1]){query(val,l,mid,tr<<1);}elsequery(val,mid+1,r,tr<<1|1);pushup(tr);}int main(){while(scanf("%d%d%d",&h,&w,&n)!=EOF){if(h>n)h=n;build_tr(1,h,1);while(n--){int temp;scanf("%d",&temp);query(temp,1,h,1);}}}
0 0
- HDOJ 题目2795 Billboard(线段树单点更新)
- hdoj 2795 Billboard 【线段树 单点更新 + 维护区间最大值】
- HDOJ 2795 Billboard (线段树 + 单点更新,求区间最大值)
- HDOJ-2795 Billboard [线段树][单点更新+单点查询+维护区间最值]
- HDU 2795 Billboard [线段树-单点更新]
- hdu 2795 Billboard 线段树 单点更新
- HDU 2795 Billboard / 线段树单点更新
- HDU-2795 Billboard 线段树单点更新
- hdu 2795 Billboard 线段树 单点更新
- hdu 2795 Billboard (线段树,单点更新)
- HDU-2795-Billboard-线段树单点更新
- HDU 2795 Billboard // 线段树 单点更新
- HDU 2795 Billboard 线段树单点更新
- HDU 2795 Billboard 线段树单点更新
- Billboard(线段树,单点更新)
- hdu2795 Billboard(线段树,单点更新)
- hdu2795 Billboard (线段树,单点更新)
- Billboard(线段树 单点更新)
- WordPress头像无法显示两种解决办法
- 左连接、右连接、交叉连接、全外连接
- Dijkstra算法(两种写法)
- leetocde_Binary Tree Right Side View
- Linux shell "此处需要整数表达式"
- HDOJ 题目2795 Billboard(线段树单点更新)
- C语言指针
- 循环结构中break、continue、return和exit的区别
- 数字的空洞 水 南邮NOJ 1071
- seaJS
- HDU 1358 Period
- UIViewController的生命周期
- 将DOC文件转化为PDF文件
- 构造二叉搜索树C++