hdoj 2795 Billboard 【线段树 单点更新 + 维护区间最大值】

Billboard

Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 15719    Accepted Submission(s): 6629

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

 

题意：有一个高h宽w的公告栏，如今要在上边贴N个1*W的公告。要求1。要在可以全然放下的区域贴公告。2，贴公告时遵循最上最左的原则。问你每张公告分别贴在第几行，若公告无法插入输出-1。

思路：以min(h, N)为区间右边界建立线段树，初始化每一个区间最大值Max为w。

之后每次贴公告就是——找一个Max值最大的区间插入 + 维护区间最大值。若Max[1] < W说明不能插入。

AC代码：

#include <cstdio>
#include <algorithm>
#include <iostream>
#define ll o<<1
#define rr o<<1|1
using namespace std;
const int MAXN = 2 * 1e5 + 10;
struct Tree { int l, r, Max; }tree[MAXN<<2];
void PushUp(int o) {
    tree[o].Max = max(tree[ll].Max, tree[rr].Max);
}
void Build(int o, int l, int r, int v) {
    tree[o].l = l; tree[o].r = r; tree[o].Max = v;
    if(l == r) { return ; }
    int mid = (l + r) >> 1;
    Build(ll, l, mid, v); Build(rr, mid+1, r, v);
}
void Update(int o, int pos, int v) {
    if(tree[o].l == tree[o].r) {
        tree[o].Max += v;
        return ;
    }
    int mid = (tree[o].l + tree[o].r) >> 1;
    if(pos <= mid) Update(ll, pos, v);
    else Update(rr, pos, v);
    PushUp(o);
}
int Query(int o, int v) {
    if(tree[o].l == tree[o].r) {
        return tree[o].l;
    }
    if(tree[ll].Max >= v) return Query(ll, v);
    else return Query(rr, v);
}
int main()
{
    int h, w, n;
    while(scanf("%d%d%d", &h, &w, &n) != EOF) {
        Build(1, 1, min(n, h), w);
        for(int i = 1; i <= n; i++) {
            int v; scanf("%d", &v);
            if(tree[1].Max >= v) {
                int id = Query(1, v);
                printf("%d
", id);
                Update(1, id, -v);
            }
            else {
                printf("-1
");
            }
        }
    }
    return 0;
}