HDU2795 Billboard 【线段树】+【单点更新】
来源:互联网 发布:阿里云学生服务器购买 编辑:程序博客网 时间:2024/05/17 04:37
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9632 Accepted Submission(s): 4286
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 <stdio.h>#define maxn 200002#define lson l, mid, rt << 1#define rson mid + 1, r, rt << 1 | 1int tree[maxn << 2];int h, w, n, temp;int max(int a, int b){return a > b ? a : b;}void build(int l, int r, int rt){if(l == r){tree[rt] = w; return;}int mid = (l + r) >> 1;build(lson);build(rson);tree[rt] = w;}void query(int val, int l, int r, int rt){if(tree[rt] < val){printf("-1\n"); return;}if(l == r){tree[rt] -= val;printf("%d\n", r);return;}int mid = (l + r) >> 1;if(tree[rt << 1] >= val) query(val, lson);else query(val, rson);tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]);}int main(){int t;while(scanf("%d%d%d", &h, &w, &n) == 3){build(1, t = h < n ? h : n, 1);while(n--){scanf("%d", &temp);query(temp, 1, t, 1);}}return 0;}
0 0
- HDU2795:Billboard(线段树单点更新)
- HDU2795 Billboard 【线段树】+【单点更新】
- hdu2795 Billboard(线段树单点更新)
- HDU2795 Billboard 线段树 单点更新
- HDU2795 Billboard 线段树单点更新变形
- hdu2795 Billboard(线段树,单点更新)
- hdu2795 Billboard (线段树,单点更新)
- hdu2795 Billboard 线段树单点更新区间最值
- HDU2795 Billboard(线段树单点更新,区间最大值)
- hdu2795 Billboard --单点更新
- hdu2795 线段树单点更新
- hdu2795 Billboard 线段树区间更新
- hdu2795 Billboard(单点更新)
- hdu2795 Billboard(单点更新)
- HDU2795(Billboard)线段树
- HDU2795 Billboard(线段树)
- hdu2795 Billboard 线段树
- HDU2795 Billboard(线段树)
- 跨站脚本攻击-----为什么要过滤危险字符串
- 第一次的go访问七牛云存储的sdk
- iscsi问题锦集
- windows程序扫雷程序设计
- VM虚拟机中Linux扩展磁盘空间的方法
- HDU2795 Billboard 【线段树】+【单点更新】
- POJ2603
- Java多线程编程入门
- 资源
- 线性回归-实践篇
- Windows如何在cmd命令行中查看、修改、删除与添加、设置环境变量
- nyoj290动物统计加强版(字典树)
- 设计模式之十五:访问者模式(Visitor Pattern)
- log4j&&slf4j配置详解