【POJ】 3667 hotel （线段树-区间合并）

/*
sum[rt]表示这个区间内最大的连续区间长度
lsum[rt]表示这个区间左边缘最大的连续区间长度，rsum同理。
然后对于一个端点的意义，表示的是到下一个端点间的这个长度是否被占用
剩下的就是一般的线段树方法了
*/
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAX 50005
#define ls rt<<1
#define rs ls|1
#define m ((l+r)>>1)
int sum[MAX << 2], lsum[MAX << 2], rsum[MAX << 2],col[MAX<<2];

void uprt(int l, int r, int rt)
{
	int rlen = (r-l+1)>>1;
	int llen = r - l + 1 - rlen;
	lsum[rt] = lsum[ls];
	rsum[rt] = rsum[rs];
	if (lsum[rt] == llen)
		lsum[rt] += lsum[rs];
	if (rsum[rt] == rlen)
		rsum[rt] += rsum[ls];
	sum[rt] = max(rsum[ls] + lsum[rs], max(sum[ls], sum[rs]));
}

void ups(int l, int r, int rt)
{
	int rlen = (r - l + 1) >> 1;
	int llen = r - l + 1 - rlen;
	if (col[rt] == 0)
		sum[ls] = sum[rs] = 0;
	else
	if (col[rt] == 1)
	{
		sum[ls] = llen;
		sum[rs] = rlen;
	}
	if (col[rt] != -1)
	{
		rsum[ls] = lsum[ls] = sum[ls];
		lsum[rs] = rsum[rs] = sum[rs];
		col[ls] = col[rs] = col[rt];
		col[rt] = -1;
	}
}

void build(int l, int r, int rt)
{
	lsum[rt] = rsum[rt] = sum[rt] = r - l + 1;
	if (l == r)
		return;
	int mid = m;
	build(l, mid, ls);
	build(mid + 1, r, rs);
}
int query(int len, int l, int r, int rt)
{
	if (l == r)return l;
	ups(l, r, rt);
	int mid = m;
	if (sum[ls] >= len)return query(len, l, mid, ls);
	if (rsum[ls] + lsum[rs] >= len&&rsum[ls]!=0) return mid - rsum[ls] + 1;
	return query(len, mid + 1, r, rs);
}

void updata(int L, int R, int c, int l, int r, int rt)
{
	if (L <= l&&r <= R)
	{
		col[rt] = c;
		if (c == 1)
			sum[rt] = r - l + 1;
		else
		if (c == 0)
			sum[rt] = 0;
		lsum[rt] = rsum[rt] = sum[rt];
		return;
	}
	ups(l, r, rt);
	int mid = m;
	if (L <= mid)
		updata(L, R, c, l, mid, ls);
	if (R > mid)
		updata(L, R, c, mid + 1, r, rs);
	uprt(l, r, rt);
}

int main()
{
	int n, k;
	while (~scanf("%d%d", &n, &k))
	{
		memset(col, -1, sizeof(col));
		build(1, n, 1);
		int a, b, c;
		int cur;
		while (k--)
		{
			scanf("%d", &a);
			if (a == 1)
			{
				scanf("%d", &b);
				if (sum[1] < b)
					cur = 0;
				else
				{
					cur = query(b, 1, n, 1);
					updata(cur, cur + b - 1, 0, 1, n, 1);
				}
				printf("%d\n", cur);
			}
			else
			{
				scanf("%d%d", &b, &c);
				updata(b, b + c - 1, 1, 1, n, 1);
			}
		}
	}
}