hdu 2795:Billboard(线段树应用之:点更新)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2795
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
题解参考这位博主的博客:传送门
题目大意:每次贴公告时,尽量向左上方靠,即:首先选择目前能粘贴地方的最高点,然后贴到目前能粘贴地方的最左端,开始一觉得很眼熟,直觉告诉我要用线段树,关键那个时间限制更加引起了我的注意,但是还是不知道怎么用线段树维护,太菜了。。。。
看了那篇博客后,才有点思路,具体见代码:
/**线段树应用之:点更新*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
/**结点结构*/
struct Node
{
int L,R;
int v; //存放每个高度所还剩余的宽度
};
Node tree[1000010]; //用数组存储线段树,至于这道题数组要开的大小还真是个迷,开始就是因为开小了,导致没A
int ans; //存放最终结果
int h,w,n; //即题目中所提到的板的高度,宽度,以及所要粘贴公告的个数
/**建立线段树*/
void build_Tree(int root,int L,int R)
{
tree[root].L=L;
tree[root].R=R;
tree[root].v=w; //最初板上没有公告
if(L!=R)
{
int mid=(L+R)/2;
build_Tree(2*root,L,mid);
build_Tree(2*root+1,mid+1,R);
}
}
/**插入数据(即:维护线段树)*/
void Insert(int root,int num)
{
if(tree[root].L==tree[root].R)
{
tree[root].v-=num;
ans=tree[root].L;
return ;
}
/**左右子树*/
if(num<=tree[2*root].v)
Insert(2*root,num);
else
Insert(2*root+1,num);
/**更新父亲结点*/
tree[root].v=max(tree[2*root].v,tree[2*root+1].v);
}
int main()
{
while(~scanf("%d%d%d",&h,&w,&n))
{
memset(tree,0,sizeof(tree));
if(h>n)
h=n; //避免线段树过大
build_Tree(1,1,h);
int num;
ans=-1;
for(int i=1;i<=n;i++)
{
scanf("%d",&num);
if(tree[1].v>=num)
Insert(1,num);
printf("%d\n",ans);
ans=-1;
}
}
}