POJ 3667 Hotel 区间合并

题意==我有一个旅馆，有M (1 ≤ M ≤ 50,000) ，现在我只用安排客人的住房和退房就行了，现在有N(1 ≤ N < 50,000)批客人找我办理住房或退房，有两种操作
1. 1 x 有x个客人住房，而且必须房间连到一起，如果有就输出最小的房间号
2. 2 A B 有客人退房，房间号是从A开始的B个房间，就是房间号从A-(A+B-1)

思路：裸的区间合并….区间合并呢lsum就是代表当前区间从最左边的房间开始最多有多少个连续的空房间，rsum同上，sum就是此区间里最大的连续空房间数
lsum和rsum很容易就得到了
sum就是得到方式有三种，当前index的lsum或rsum,还有index*2的rsum和index*2+1的lsum

还有boom!倒着就不复习了，扫描线以后再复习，主席树，i’m coming!!!

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<map>
#include<set>
using namespace std;
#define rfor(i,a,b) for(i=a;i<=b;++i)
#define lfor(i,a,b) for(i=a;i>=b;--i)
#define sfor(i,a,h) for(i=h[a];i!=-1;i=e[i].next)
#define mem(a,b) memset(a,b,sizeof(a))
#define mec(a,b) memcpy(a,b,sizeof(b))
#define cheak(i) printf("%d ",i)
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
#define inf 0x7fffffff
typedef long long LL;
#define maxn 50005
struct Tree
{
    int sum,lsum,rsum,lazy;
}tree[maxn*4];

void build(int l,int r,int index)
{
    tree[index].sum=tree[index].lsum=tree[index].rsum=r-l+1;
    tree[index].lazy=-1;
    if(l==r) return ;
    int mid=(l+r)/2;
    build(l,mid,index*2);
    build(mid+1,r,index*2+1);
}

void fun1(int index,int k)
{
    if(tree[index].lazy==-1) return ;
    tree[index*2].lazy=tree[index*2+1].lazy=tree[index].lazy;
    tree[index*2].lsum=tree[index*2].rsum=tree[index*2].sum=tree[index].lazy?0:(k-k/2);
    tree[index*2+1].lsum=tree[index*2+1].rsum=tree[index*2+1].sum=tree[index].lazy?0:k/2;
    tree[index].lazy=-1;
}

void fun2(int index,int k)
{
    tree[index].lsum=tree[index*2].lsum;
    tree[index].rsum=tree[index*2+1].rsum;
    if(tree[index].lsum==k-k/2)
    tree[index].lsum+=tree[index*2+1].lsum;
    if(tree[index].rsum==k/2)
    tree[index].rsum+=tree[index*2].rsum;
    tree[index].sum=max(tree[index*2].rsum+tree[index*2+1].lsum,max(tree[index*2].sum,tree[index*2+1].sum));
}

int query(int l,int r,int val,int index)
{
    if(l==r) return l;
    fun1(index,r-l+1);
    int mid=(l+r)/2;
    if(tree[index*2].sum>=val)
    return query(l,mid,val,index*2);
    else if(tree[index*2].rsum+tree[index*2+1].lsum>=val)
    return mid-tree[index*2].rsum+1;
    return query(mid+1,r,val,index*2+1);
}

void insert(int l,int r,int left,int right,int val,int index)
{
    if(left<=l&&r<=right)
    {
        tree[index].lsum=tree[index].rsum=tree[index].sum=val?0:r-l+1;
        tree[index].lazy=val;
        return ;
    }
    fun1(index,r-l+1);
    int mid=(l+r)/2;
    if(left<=mid)
    insert(l,mid,left,right,val,index*2);
    if(right>mid)
    insert(mid+1,r,left,right,val,index*2+1);
    fun2(index,r-l+1);
}

int main()
{
    int n,m,b,k,c,a,i;
    while(~scanf("%d%d",&m,&n))
    {
        build(1,m,1);
        rfor(i,1,n)
        {
            scanf("%d%d",&a,&b);
            if(a==1)
            {

                if(tree[1].sum<b) 
                {
                    printf("0\n");
                    continue;
                } 
                k=query(1,m,b,1);
                printf("%d\n",k);
                insert(1,m,k,k+b-1,1,1);
            }
            else
            {
                scanf("%d",&c);
                insert(1,m,b,b+c-1,0,1);
            }
        }
    }
    return 0;
}