Hdu-Billboard

题目名称：Billboard

题目链接：Billboard

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

题目大意

有一个宽h长w的广告栏，现在要按照尽量靠上靠左的原则贴宽为1长为 q的广告，请问应该贴到哪一行，如果贴不上则输出 “-1”

解题思路

简单的线段树问题，毕竟每一行的可用宽度可以用一个整型来表示，所以在这里就按照广告栏的高度为界限建立线段树，第一次提交程序runntime error，参考别人的博客后发现是线段树界限设置的问题，改为高度或广告总数的最小值即可

完整代码

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
#define N 210000
struct Node{
	int l,r,val;
}node[N<<2];
int h,w,n;

void build(int l,int r,int i){   //线段树创建模板
	node[i].l=l;
	node[i].r=r;
	node[i].val=w;
	if(l==r) return ;
	int mid=(l+r)>>1;
	build(l,mid,i<<1);
	build(mid+1,r,i<<1|1);
} 

int query(int k,int i){      //查询
	if(node[i].l==node[i].r) {
		node[i].val-=k;
		return node[i].l;
	}
	int ans;
	if(node[i<<1].val>=k){                        //按照最上方最左边的原则进行粘贴
		ans=query(k,i<<1);
	}else{
		ans=query(k,i<<1|1);
	}
	node[i].val=max(node[i<<1].val,node[i<<1|1].val);   //剩下的空间
	return ans;
}

int main()
{
	int k;
	while(~scanf("%d%d%d",&h,&w,&n)){
		h=min(h,n);
		build(1,h,1);
		for(int i=0;i<n;i++){
			cin>>k;
			if(k>node[1].val) printf("-1\n");    //如果大于所剩的空间，则直接无解
			else printf("%d\n",query(k,1));
		}
	}
	return 0;
}