POJ 3667 Hotel -- 线段树

POJ 3667 Hotel
区间合并操作，但是OJ上数据貌似有点水了。
维护以下几个值：
区间最长连续0串的长度sum
以区间左端点为起点的向右的最长连续0串的长度lsum
以区间右端点为起点的向左的最长连续0串的长度rsum

对于合并操作
先常规的根据左右节点更新当前节点的值

tree[root].lsum = tree[root << 1].lsum;
tree[root].rsum = tree[root << 1 | 1].rsum;
tree[root].sum = max(tree[root << 1].sum, tree[root << 1 | 1].sum);

然后是区间可扩展时

if (tree[root << 1].lsum == tree[root << 1].r - tree[root].l + 1)tree[root].lsum += tree[root << 1 | 1].lsum;
if (tree[root << 1 | 1].rsum == tree[root << 1 | 1].r - tree[root << 1 | 1].l + 1)tree[root].rsum += tree[root << 1].rsum;

tree[root].sum = max(tree[root].sum, max(tree[root].lsum, tree[root].rsum));

最后是区间合并情况下

tree[root].sum = max(tree[root].sum, tree[root << 1].rsum + tree[root << 1 | 1].lsum);

//#include<bits/stdc++.h>
#include<iostream>
//#include <unordered_map>
#include<algorithm>
using namespace std;
//template<class...Args>
//void debug(Args... args) {//Parameter pack
//    auto tmp = { (cout << args << ' ', 0)... };
//    cout << "\n";
//}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 1e9+7;

struct node {
    int l, r;
    int sum;//区间的最大连续段，用于查找
    int lsum, rsum;//以左右端点为起点的最大连续段，用于合并
    int flag;//区间状态 0为全空 1为全满 -1为有空有满
    int len() { return r - l + 1; }
};
struct Segtree {
    node tree[N << 2];
    void push_up(int root) {
        tree[root].lsum = tree[root << 1].lsum;
        tree[root].rsum = tree[root << 1 | 1].rsum;
        tree[root].sum = max(tree[root << 1].sum, tree[root << 1 | 1].sum);

        if (tree[root << 1].lsum == tree[root << 1].r - tree[root].l + 1)tree[root].lsum += tree[root << 1 | 1].lsum;
        if (tree[root << 1 | 1].rsum == tree[root << 1 | 1].r - tree[root << 1 | 1].l + 1)tree[root].rsum += tree[root << 1].rsum;

        tree[root].sum = max(tree[root].sum, max(tree[root].lsum, tree[root].rsum));
        tree[root].sum = max(tree[root].sum, tree[root << 1].rsum + tree[root << 1 | 1].lsum);

        if (tree[root << 1].flag == tree[root << 1 | 1].flag)tree[root].flag = tree[root << 1].flag;
        else tree[root].flag = -1;
    }
    void build(int root, int l, int r) {
        if (l == r)tree[root] = { l,r,1,1,1,0 };
        else {
            tree[root] = { l,r };
            int mid = l + r >> 1;
            build(root << 1, l, mid);
            build(root << 1 | 1, mid + 1, r);
            push_up(root);
        }
    }
    void push_down(int root) {
        if (tree[root].flag != -1) {
            if (tree[root].flag == 0) {
                tree[root << 1].sum = tree[root << 1].lsum = tree[root << 1].rsum = tree[root << 1].len();
                tree[root << 1 | 1].sum = tree[root << 1 | 1].lsum = tree[root << 1 | 1].rsum = tree[root << 1 | 1].len();
            }
            else {
                tree[root << 1].sum = tree[root << 1].lsum = tree[root << 1].rsum = 0;
                tree[root << 1 | 1].sum = tree[root << 1 | 1].lsum = tree[root << 1 | 1].rsum = 0;
            }
            tree[root << 1].flag = tree[root << 1 | 1].flag = tree[root].flag;
        }
    }
    void modify(int root, int l, int r, int val) {
        if (l <= tree[root].l && tree[root].r <= r) {
            if (val == 0) {
                tree[root].flag = val;
                tree[root].sum = tree[root].r - tree[root].l + 1;
                tree[root].lsum = tree[root].rsum = tree[root].sum;
            }
            else {
                tree[root].flag = val;
                tree[root].sum = 0;
                tree[root].lsum = tree[root].rsum = tree[root].sum;
            }
        }
        else {
            push_down(root);
            int mid = tree[root].l + tree[root].r >> 1;
            if (l <= mid)modify(root << 1, l, r, val);
            if (r > mid)modify(root << 1 | 1, l, r, val);
            push_up(root);
        }
    }
    int query(int root, int len) {
        if (tree[root].l == tree[root].r)return tree[root].l;
        else {
            push_down(root);
            int pos;
            if (tree[root << 1].sum >= len)pos = query(root << 1, len);
            else if (tree[root << 1].rsum + tree[root << 1 | 1].lsum >= len)pos = tree[root << 1].r - tree[root << 1].rsum + 1;
            else pos = query(root << 1 | 1, len);
            push_up(root);
            return pos;
        }
    }
}seg;

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    int n, m;
    cin >> n >> m;
    seg.build(1, 1, n);
    while (m--) {
        int type;
        cin >> type;
        if (type == 1) {
            int len;
            cin >> len;
            if (seg.tree[1].sum >= len) {
                int pos = seg.query(1, len);
                seg.modify(1, pos, pos + len - 1, 1);
                cout << pos << "\n";
            }
            else cout << 0 << "\n";
        }
        else {
            int pos, len;
            cin >> pos >> len;
            seg.modify(1, pos, pos + len - 1, 0);
        }
    }
    
    return 0;
}