Billboard(线段树)
来源:互联网 发布:灯光效果设计软件 编辑:程序博客网 时间:2024/06/10 14:17
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
解题思路
AC代码
#include <cstdio>#include <iostream>using namespace std;#define lson l, m, rt << 1#define rson m + 1, r, rt << 1 | 1const int maxn = 200005;int Max[maxn << 2];int h, w, n;void PushUp(int rt){ Max[rt] = max(Max[rt << 1], Max[rt << 1 | 1]);}void build(int l, int r, int rt = 1){ if( l == r) { Max[rt] = w; return ; } int m = (l + r) >> 1; build(lson); build(rson); PushUp(rt);}void query(int a, int l, int r, int rt = 1){ if(l == r) { Max[rt] -= a; printf("%d\n", l); return ; } int m = (l + r) >> 1; if(Max[rt << 1] >= a) query(a, lson); else query(a, rson); PushUp(rt);}int main(){ int a; while(scanf("%d%d%d", &h, &w, &n) != EOF) { if(h > n) h = n; build(1, h); while(n--) { scanf("%d", &a); if(Max[1] < a) printf("-1\n"); else query(a, 1, h); } } 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(贴海报)
- hdu 4950
- Weblogic中 web.xml 使用servlet 2.4声明时Filter报错
- 使用jstree自定义下拉菜单树组件
- poj1651 Multiplication Puzzle
- C/C++连接MySql数据库
- Billboard(线段树)
- android产生随机数
- C++类设计模版
- Maven 工程的 jdk 配置(三个版本一致)
- 敏捷开发—用户故事
- LeetCode | Flatten Binary Tree to Linked List(二叉树转化成链表)
- poj 2151 Check the difficulty of problems(概率dp)
- 学习OpenGL(五)颜色、光照与材质
- poj1269 Intersecting Lines(简单几何,直线平行,共线或相交)