题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2795点击打开链接
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24249 Accepted Submission(s): 9984
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.
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.
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很大 但是受限于海报数量 因此最多只需要最大海报数量的空间就够了
#include <bits/stdc++.h>
using namespace std;
#define maxn 200010
struct xjy
{
int left;
int right;
int target;
int lazy;
int sum;
int mmax;
};
xjy tree[maxn<<2];
int w,h,n;
int flag;
void build(int i,int left ,int right)
{
if(left==right)
{
tree[i].left=left;
tree[i].right=right;
tree[i].sum=w;
tree[i].mmax=w;
return ;
}
int mid=(left+right)>>1;
build(i<<1,left,mid);
build (i<<1|1,mid+1,right);
tree[i].sum=w;
tree[i].left=left;
tree[i].right=right;
tree[i].mmax=w;
}
void updateregion(int i,int val)
{
if(tree[i].mmax<val||flag)
{
return;
}
if(tree[i].left==tree[i].right&&tree[i].sum>=val)
{
tree[i].sum-=val;
tree[i].mmax-=val;
flag=1;
printf("%d\n",tree[i].left);
return;
}
if(tree[i].left==tree[i].right)
return;
int mid=(tree[i].left+tree[i].right)>>1;
updateregion(i<<1,val);
updateregion(i<<1|1,val);
tree[i].mmax=max(tree[i<<1].mmax,tree[i<<1|1].mmax);
}
int main()
{
int n,m;
int t;
while(~scanf("%d%d%d",&h,&w,&t))
{
for(int i=0;i<maxn;i++)
{
tree[i].lazy=0;
tree[i].left=0;
tree[i].right=0;
tree[i].sum=0;
tree[i].target=0;
}
if(h>maxn)
h=maxn;
build(1,1,h);
int mid;
for(int i=1;i<=t;i++)
{
scanf("%d",&mid);
flag=0;
updateregion(1,mid);
if(!flag)
printf("-1\n");
}
}
}