HDU - 2795 Billboard —— 点更新 区间查询

Billboard

Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24739    Accepted Submission(s): 10155

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。所有种类的广告都可以贴，比如ACM的广告啊，还有餐厅新出了哪些好吃的，等等。。

 

在9月1号这天，广告牌是空的，之后广告会被一条一条的依次贴上去。

 

每张广告都是高度为1宽度为wi的细长的矩形纸条。

 

贴广告的人总是会优先选择最上面的位置来帖，而且在所有最上面的可能位置中，他会选择最左面的位置，而且不能把已经贴好的广告盖住。

如果没有合适的位置了，那么这张广告就不会被贴了。

 

现在已知广告牌的尺寸和每张广告的尺寸，求每张广告被贴在的行编号。

Input

多组样例，不超过40个。

 

对每组样例，第一行包含3个整数h，w，n(1 <= h,w <= 10^9; 1 <= n <= 200,000) -广告牌的尺寸和广告的个数。 

下面n行每行一个整数 wi (1 <= wi <= 10^9) -  第i张广告的宽度.

Output

对每张广告，输出它被贴在的行编号（是1到h之间的数），顶部是第一行。如果某广告不能被贴上，则输出-1。

思路：用线段树维护每一段区间中可以贴的最大宽度 更新时找最左侧的区间进行更新 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#define max_ 200010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
struct node 
{
	int l,r,w;
};
struct node tree[max_*4];
int h,w,n,fi;
void built(int i,int l,int r)
{
	tree[i].l=l;
	tree[i].r=r;
	tree[i].w=w;
	if(l==r)
		return;
	int mid=(l+r)>>1;
	built(i<<1,l,mid);
	built(i<<1|1,mid+1,r);
}
void updata(int i,int x)
{
	if(tree[i].l==tree[i].r)
	{
		tree[i].w-=x;
		fi=tree[i].l;
		return;
	}
	if(tree[i<<1].w>=x)
		updata(i<<1,x);
	else
		updata(i<<1|1,x);
	tree[i].w=max(tree[i<<1].w,tree[i<<1|1].w);
}
int main(int argc, char const *argv[])
{
	while(scanf("%d%d%d",&h,&w,&n)!=EOF)
	{
		memset(tree,0,sizeof(tree));
		int i;
		if(h>n)
			h=n;
		built(1,1,h);
		for(i=0;i<n;i++)
		{
			int x;
			scanf("%d",&x);
			if(x<=tree[1].w)
			{
				updata(1,x);
				printf("%d\n",fi );
			}
			else
				printf("-1\n");
		}
	}
	return 0;
}