线段树

Problem B. Billboard 

Input file: billboard.in Output file: billboard.out Time limit: 3 seconds Memory limit: 256 megabytes

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 

The first line of the input file contains three integer numbers, h, w, and n (1 ≤ h,w ≤ 109; 1 ≤ n ≤ 200000) — the dimensions of the billboard and the number of announcements. Each of the next n lines contains an integer number wi (1 ≤ wi ≤ 109) — 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.
Example
billboard.in 

3 5 5 2 4 3 3 3

billboard.out

1 2 1 3 -1

题意：在一个高h，宽w的布告栏上贴广告，每张广告高均为1，给出宽度，每次以左上最优先，问每张广告贴在第几行。

思路：询问次数达到20万，用优先队列会超时。可以用线段树，维护区间最大值，左边优先。

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>

using namespace std;
int maxx[2000000<<4];
int H, W, n;

void Build(int l, int r, int rt)
{
    maxx[rt] = W;
    if(l == r) return ;
    int mid = (l+r)>>1;
    Build(l, mid, rt<<1);
    Build(mid+1, r, rt<<1|1);
}

void query(int l, int r, int rt, int x)
{
    if(x > maxx[rt]) { // 没有放得下的，退出
        printf("-1\n");
        return;
    }
    if(l == r) { // 找到放得下的，输出
        printf("%d\n", l);
        maxx[rt] -= x;
        return ;
    }
    int mid = (l + r) >>1;
    if(x <= maxx[rt<<1]) query(l, mid, rt<<1, x); // 左边先查找
    else if(x <= maxx[rt<<1|1]) query(mid+1, r, rt<<1|1, x);
    maxx[rt] = max(maxx[rt<<1], maxx[rt<<1|1]);
}

int main()
{
    freopen("billboard.in", "r", stdin);
    freopen("billboard.out", "w", stdout);
    scanf("%d%d%d", &H, &W, &n);
    int r = min(H, n);
    int x;
    Build(1, min(H, n), 1);
    while(n--) {
        scanf("%d", &x);
        query(1, r, 1, x);
    }
}