本文共 2740 字，大约阅读时间需要 9 分钟。
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 3Sample Output
1 2 1 3 -1在一个h*w大的地方贴1*x的海报，每次尽量贴最上面的左边，求每次海报能贴在第几行。
可以把高度表示成区间，每个单位高度的值是w，每次找到可用最大的值，返回第几行，并且更新这个最大值。#include#include #include #include #include #include #include #include #include #define INF 0x3f3f3f3f#define MAXN 25#define Mod 10001using namespace std;#define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1const int maxn=222222;int h,w,n;long long max(long long a,long long b){ if(a>b) return a; else return b;}long long MAX[maxn<<2];void PushUp(int rt){ MAX[rt]=max(MAX[rt<<1],MAX[rt<<1|1]);}void build(int l,int r,int rt){ if(r==l) { MAX[rt]=w; return; } int m=(l+r)>>1; build(lson); build(rson); PushUp(rt);}int query(int x,int l,int r,int rt){ if(l==r) { MAX[rt]-=x; return l; } int m=(l+r)>>1; int ret=0; if(MAX[rt<<1]>=x) ret=query(x,lson); else ret=query(x,rson); PushUp(rt); return ret;}int main(){ while(~scanf("%d%d%d",&h,&w,&n)) { if(h>n) h=n; build(1,h,1); while(n--) { int x; scanf("%d",&x); if(MAX[1]
转载地址：http://qpcvb.baihongyu.com/