HDU 2795 Billboard //线段树简单应用
2014-07-25 15:15
344 查看
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10074 Accepted Submission(s): 4482
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.
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.
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 5 2 4 3 3 3
Sample Output
1 2 1 3 -1
Author
hhanger@zju
Source
HDOJ 2009 Summer Exercise(5)
Recommend
lcy | We have carefully selected several similar problems for you: 1698 1166 1542 1828 1540
#include <stdio.h> struct node { int l, r; int max; }tree[600000]; int MAX(int a, int b) { if(a>b) return a; return b; } void build(int l, int r, int n, int a) { int mid; tree .l=l, tree .r=r; if(l==r) { tree .max = a; return ; } mid = (tree .l + tree .r)>>1; build(l, mid, 2*n, a); build(mid+1, r, 2*n+1, a); tree .max = a; } void update(int n) { int k; k = n/2; while(k) { tree[k].max = MAX(tree[k*2].max, tree[k*2+1].max); k = k/2; } return; } int add(int n, int a, int k) { if(tree .max >= a && tree .l <= k) { if(tree .l == tree .r) { tree .max -= a; update(n); return tree .l; } if(tree[n*2].max >= a) add(2*n, a, k); else add(2*n+1, a, k); } else return -1; } int main() { int h, w, n; int i; int aw; while(scanf("%d%d%d", &h, &w, &n)!=-1) { build(1, n, 1, w); for(i=0; i<n; i++) { scanf("%d", &aw); printf("%d\n", add(1, aw, h)); } } return 0; }
相关文章推荐
- 【解题报告】 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 1754 简单的线段树应用
- hdu 2795 Billboard(线段树点区)
- HDU-2795 Billboard 线段树
- 线段树练习[单点更新] HDU 2795 Billboard
- 线段树练习[单点更新] HDU 2795 Billboard
- 线段树单点更新 hdu 2795 Billboard
- HDU-2795 Billboard 线段树|树状数组
- hdu 2795 Billboard(线段树)
- Billboard----HDU_2795----线段树之单点更新
- HDU 2795 billboard 线段树
- hdu - 2795 - Billboard(线段树)
- hdu 2795 Billboard(线段树点区)