HDU-Billboard-2795（線段樹），hdu線段樹
hdu2795
Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14101 Accepted Submission(s): 6046
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
Author
hhanger@zju
//鏈接：http://acm.hdu.edu.cn/showproblem.php?pid=2795
//思路：線段樹葉節點保存第i行已貼通知總寬度，父節點保存左右子數較小值，在能寬度合適條件下，盡量向左走
//注意：行數達不到10^9
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
using namespace std;
//#define min(a,b) (a)<(b)?(a):(b)
#define MAX 200100
int tree[MAX<<2];
int w;
/*void build(int l,int r,int rt)
{
if(l==r){scanf("%d",&tree[rt]);return;}
int m=(l+r)>>1;
build(l,m,rt<<1);
build(m+1,r,rt<<1|1);
tree[rt]=tree[rt<<1]+tree[rt<<1|1];
}*/
int update(int data,int l,int r,int rt)
{
int ans;
if(l==r){tree[rt]+=data;return l;}
int m=(l+r)>>1;
if(tree[rt<<1]+data<=w)ans=update(data,l,m,rt<<1);
else ans=update(data,m+1,r,rt<<1|1);
tree[rt]=min(tree[rt<<1],tree[rt<<1|1]);
return ans;
}
int main()
{
int h,n,wi;
while(~scanf("%d%d%d",&h,&w,&n))
{
memset(tree,0,sizeof(tree));
for(int i=0;i<n;i++)
{
scanf("%d",&wi);
if(tree[1]+wi>w){printf("-1\n");continue;}
int ans;
if(h<=200000)ans=update(wi,1,h,1);
else ans=update(wi,1,n,1);
printf("%d\n",ans);
}
}
return 0;
}
