poj 3667(区间合并)

题意：一个宾馆有n间房，标号从1到n，然后有两种操作，1 a表示找连续的a间房住人，有多个就取最左边并输出连续a间的第一间的编号，2 a b表示从编号a开始之后的b间房要清空。
题解：线段树维护三个值，区间左端点开始连续的最大数量的空房treel[k]、右端点开始连续的最大数量的空房treer[k]，整个区间最大的连续空房数量tree[k]，在pushup操作时注意区间合并的细节。

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 50005;
int n, m, tree[N << 2], treel[N << 2], treer[N << 2], flag[N << 2];

void pushup(int k, int left, int right) {
    int mid = (left + right) / 2;
    treel[k] = treel[k * 2];
    treer[k] = treer[k * 2 + 1];
    tree[k] = max(tree[k * 2], tree[k * 2 + 1]);
    if (treel[k * 2] == mid - left + 1)
        treel[k] += treel[k * 2 + 1];
    if (treer[k * 2 + 1] == right - mid)
        treer[k] += treer[k * 2];
    tree[k] = max(tree[k], max(treel[k], treer[k]));
    tree[k] = max(tree[k], treer[k * 2] + treel[k * 2 + 1]);
}

void pushdown(int k, int left, int right) {
    if (flag[k] != -1) {
        if (flag[k] == 1) {
            tree[k * 2] = treel[k * 2] = treer[k * 2] = 0;
            tree[k * 2 + 1] = treel[k * 2 + 1] = treer[k * 2 + 1] = 0;
            flag[k * 2] = flag[k * 2 + 1] = 1;
        }
        else {
            int mid = (left + right) / 2;
            tree[k * 2] = treel[k * 2] = treer[k * 2] = mid - left + 1;
            tree[k * 2 + 1] = treel[k * 2 + 1] = treer[k * 2 + 1] = right - mid;
            flag[k * 2] = flag[k * 2 + 1] = 0;
        }
        flag[k] = -1;
    }
}

void build(int k, int left, int right) {
    flag[k] = -1;
    tree[k] = treel[k] = treer[k] = right - left + 1;
    if (left != right) {
        int mid = (left + right) / 2;
        build(k * 2, left, mid);
        build(k * 2 + 1, mid + 1, right);
    }
}

void modify(int k, int left, int right, int l, int r, int v) {
    if (l <= left && right <= r) {
        if (v == 1) {
            flag[k] = 1;
            tree[k] = treel[k] = treer[k] = 0;
        }
        else {
            flag[k] = 0;
            tree[k] = treel[k] = treer[k] = right - left + 1;
        }
        return;
    }
    pushdown(k, left, right);
    int mid = (left + right) / 2;
    if (l <= mid)
        modify(k * 2, left, mid, l, r, v);
    if (r > mid)
        modify(k * 2 + 1, mid + 1, right, l, r, v);
    pushup(k, left, right);
}

int query(int k, int left, int right, int len) {
    if (left == right)
        return left;
    pushdown(k, left, right);
    int mid = (left + right) / 2, res;
    if (tree[k * 2] >= len)
        res = query(k * 2, left, mid, len);
    else if (treel[k * 2 + 1] + treer[k * 2] >= len)
        res = mid - treer[k * 2] + 1;
    else res = query(k * 2 + 1, mid + 1, right, len);
    pushup(k, left, right);
    return res;
}

int main() {
    while (scanf("%d%d", &n, &m) == 2) {
        build(1, 1, n);
        int op, a, b;
        while (m--) {
            scanf("%d%d", &op, &a);
            if (op == 1) {
                if (tree[1] >= a) {
                    int pos = query(1, 1, n, a);
                    printf("%d\n", pos);
                    modify(1, 1, n, pos, pos + a - 1, 1);
                } else printf("0\n");
            }
            else {
                scanf("%d", &b);
                modify(1, 1, n, a, a + b - 1, 0);
            }
        }
    }
    return 0;
}