线段树区间合并P2894

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n , m;
struct node
{
    int l , r;
    int lsum , rsum , sum;
    int lz;
}tree[50000*4];
void pushdown(int i)
{
    if(tree[i].lz != -1)
    {
        tree[i << 1].lz = tree[i << 1 | 1].lz = tree[i].lz;
        tree[i << 1].lsum = tree[i << 1].rsum = tree[i << 1].sum = tree[i].lz ? 0 : tree[i << 1].r - tree[i << 1].l + 1;
        tree[i << 1 | 1].lsum = tree[i << 1 | 1].rsum = tree[i << 1 | 1].sum = tree[i].lz ? 0 : tree[i << 1 | 1].r - tree[i << 1 | 1].l + 1;
        tree[i].lz = -1;
    }
}
void pushup(int i)
{
    tree[i].lsum = tree[i << 1].lsum;
    tree[i].rsum = tree[i << 1 | 1].rsum;
    if(tree[i].lsum == tree[i << 1].r - tree[i << 1].l + 1) tree[i].lsum += tree[i << 1 | 1].lsum;
    if(tree[i].rsum == tree[i << 1 | 1].r - tree[i << 1 | 1].l + 1) tree[i].rsum += tree[i << 1].rsum;
    tree[i].sum = max(tree[i << 1].rsum + tree[i << 1 | 1].lsum, max(tree[i << 1].sum ,tree[ i << 1 | 1].sum));
}
int query(int i , int x)
{
    if(tree[i].l == tree[i].r)
        return tree[i].l;
    pushdown(i);
    if(tree[i << 1].sum >= x) return query(i<<1, x);
    else if(tree[i << 1].rsum + tree[i << 1 | 1].lsum >= x) return tree[i<<1].r - tree[i << 1].rsum + 1;
    return query(i << 1 | 1, x);
}
void add(int i ,int l , int r , int x)
{
    if(tree[i].l >= l && tree[i].r <= r)
    {
        tree[i].lsum = tree[i].rsum = tree[i].sum = x ? 0 : tree[i].r - tree[i].l + 1;
        tree[i].lz = x;
        return ;
    }
    pushdown(i);
    if(l <= tree[i << 1].r) add(i << 1, l, r, x);
    if(r >= tree[i << 1 | 1].l) add(i << 1 | 1, l, r, x);
    pushup(i);
}
void build(int i , int l , int r)
{
    tree[i].l = l, tree[i].r = r;
    tree[i].lsum = tree[i].rsum = tree[i].sum = r - l + 1;
    tree[i].lz = -1;
    if(l == r)
        return ;
    int mid = (l + r) >> 1;
    build(i << 1, l, mid);
    build(i << 1 | 1 , mid + 1, r);

}
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    build(1,1,n);
    for(int i = 1 ; i <= m ; i ++)
    {
        int op ;
        cin>>op;
        int x , y;
        if(op == 1)
        {
            cin>>x;
            if(tree[1].sum < x)
            {
                cout<<"0"<<endl;
                continue;
            }
            int cnt = query(1,x);
            cout<<cnt<<endl;
            add(1,cnt,cnt+x-1,1);
        }
        else
        {
            cin>>x>>y;
            add(1,x,x+y-1,0);
        }
    }
}