Billboard
Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10594 Accepted Submission(s): 4686
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.
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.
2
4
3
3
3
2
1
3
-1
代码： 代码写的比较脆，花掉的时间是：3795ms 呵~~呵~~ ,呵了个呵的！
/*基础的线段树*/
#include<cstdio>
#include<cstring> const int maxn= ;
int aa[maxn]; struct node
{
int lef,rig,mx;
int mid(){
return lef+((rig-lef)>>);
}
}; int h,w,n;
node reg[maxn<<];
inline int max(int a,int b)
{
return a>b?a:b;
} void Build(int lef,int rig,int pos)
{
reg[pos]=(node){lef,rig,w};
if(lef==rig) return ;
int mid=reg[pos].mid();
Build(lef,mid,pos<<);
Build(mid+,rig,pos<<|);
} void Work(int val,int pos)
{
if(reg[pos].mx>=val)
{
if(reg[pos].rig==reg[pos].lef)
{
reg[pos].mx-=val;
printf("%d\n",reg[pos].rig);
return ;
}
if(val<=reg[pos<<].mx)
Work(val,pos<<);
else
Work(val,pos<<|);
reg[pos].mx=max(reg[pos<<].mx,reg[pos<<|].mx);
}
else if(pos==) printf("-1\n");
return ;
} int main()
{
int cn;
while(scanf("%d%d%d",&h,&w,&n)!=EOF)
{
if(h>n) h=n;
Build(,h,);
while(n--)
{
scanf("%d",&cn);
Work(cn,);
}
}
return ;
}