ZOJ 1610 Count the Colors 线段树 区间覆盖

题意：给一行画纸，在一些段上涂上颜色，每次给出段的左右端点和涂的颜色，求出最后从上往下看能看到的所有颜色，及各颜色的段数
思路：区间覆盖问题。每次更新区间颜色，最后查询时，对于叶子节点，记录当前颜色，若当前颜色等于之前记录过的颜色，表示仍处于连续的段中，若不等表示处于另一段，并更新记录的颜色。求出各个连续段中颜色出现的次数即可

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const int inf = 0x3f3f3f3f;
ll n, tree[maxn], res[maxn], cur;
void pushdown(ll p)
{
	tree[p<<1] = tree[p<<1|1] = tree[p];
	tree[p] = -1;
}
void update(ll k, ll x, ll y, ll l, ll r, ll p)
{
	if (x <= l && y >= r) {
		tree[p] = k;
		return;
	}
	if (tree[p] != -1)
		pushdown(p);
	ll mid = (l+r)>>1;
	if (x <= mid) 
		update(k, x, y, l, mid, p<<1);
	if (y > mid)
		update(k, x, y, mid+1, r, p<<1|1);
}
void query(ll p, ll l, ll r)
{
	if (l == r) {
		if (tree[p] != -1 && cur != tree[p])
			res[tree[p]]++;
		cur = tree[p];
		return;
	}
	if (tree[p] != -1)
		pushdown(p);
	int mid = (l+r)>>1;
	query(p<<1, l, mid);
	query(p<<1|1, mid+1, r);
}
int main()
{
	while (~scanf("%d", &n)) {
		int x, y, c;
		memset(res, 0, sizeof(res));
		memset(tree, -1, sizeof(tree));
		cur = -1;
		for (int i = 0; i < n; i++) {
			scanf("%d%d%d", &x, &y, &c);
			update(c, x+1, y, 1, 8000, 1);
		}
		query(1, 1, 8000);
		for (int i = 0; i <= 8000; i++)
			if (res[i]) {
				printf("%d %d\n", i, res[i]);
			}
		printf("\n");
	}
	return 0;
}