Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 24414 Accepted Submission(s): 10040
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<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int mx[200007<<2];
long h,w,n;
void build(int l,int r,int rt)
{
mx[rt] = w;
if(l==r)
{
return;
}
int mid = (l + r)/2;
build(l,mid ,rt*2);//递归建左子树
build(mid + 1,r,rt * 2 +1);//递归建右子树
}
long update(int l,int r,int rt,int t)
{
if(l==r)//到达叶子节点
{
mx[rt] -= t;//返回那个区间
return l;
}
int mid = (l + r)/2;
long ans ;
if(mx[rt * 2]>=t)//判断左子树是否大于t 由于他说了是靠左上角开始放 所以先判断 左子树
ans = update(l,mid,rt*2,t);
else
ans = update(mid+1,r,rt*2 +1,t);
mx[rt] = max(mx[rt*2],mx[rt*2+1]);//此时子节点已经全部更新完了 在更新父节点
return ans;
}
int main()
{
while(~scanf("%d%d%d",&h,&w,&n))
{
//memset(mx,0,sizeof(mx));
if(h>n) h = n;//最多只有n个
build(1,h,1);
// cout<<mx[1]<<endl;
while(n--)
{
int tt;
scanf("%d",&tt);
if(mx[1]<tt)//如果这个最大的区间都比tt要小 那么就真的放不下了
{
printf("%d\n",-1);
}
else
{
printf("%ld\n",update(1,h,1,tt));
}
}
}
return 0;
}