hdu 5023(线段树)

题意：有一个人要在墙上刷漆，先把墙上分为n块，全部刷成颜色2，然后两种操作P a b c表示把区域a到b刷成颜色c，Q a b表示问区域a到区域b有哪几种颜色。

题解：看大牛思路是用状态压缩，有哪种颜色就标记哪一位，然后用线段树区间修改就可以了，最后查询判断当前区间是的数字哪些位上是1，解中就有这种颜色。。

#include <stdio.h>
const int N = 4000000;
int n, m, a, b, c, color[N], setc[N];

void pushup(int k) {
	color[k] = color[k * 2] | color[k * 2 + 1];
}

void pushdown(int k) {
	if (setc[k]) {
		int lc = k * 2, rc = k * 2 + 1;
		setc[lc] = setc[k];
		setc[rc] = setc[k];
		color[lc] = setc[k];
		color[rc] = setc[k];
		setc[k] = 0;
	}
}

void update(int k, int left, int right) {
	int lc = k * 2, rc = k * 2 + 1;
	if (a <= left && right <= b) {
		setc[k] = 1 << (c - 1);
		color[k] = 1 << (c - 1);
		return;
	}
	pushdown(k);
	int mid = (left + right) / 2;
	if (a <= mid)
		update(lc, left, mid);
	if (b > mid)
		update(rc, mid + 1, right);
	pushup(k);
}

int query(int k, int left, int right) {
	if (a <= left && right <= b)
		return color[k];
	pushdown(k); //取子节点值也要标记传递!!
	int res = 0, mid = (left + right) / 2;
	if (a <= mid)
		res |= query(k * 2, left, mid);
	if (b > mid)
		res |= query(k * 2 + 1, mid + 1, right);
	return res;
}

void build(int k, int left, int right) {
	setc[k] = 0;
	if (left == right) {
		color[k] = 2;
		return;
	}
	int mid = (left + right) / 2;
	build(k * 2, left, mid);
	build(k * 2 + 1, mid + 1, right);
	pushup(k);
}

int main() {
	while (scanf("%d%d", &n, &m) && n + m) {
		char str[5];
		build(1, 1, n);
		while (m--) {
			scanf("%s%d%d", str, &a, &b);
			if (str[0] == 'P') {
				scanf("%d", &c);
				update(1, 1, n);
			}
			else {
				int res, flag = 0;
				res = query(1, 1, n);
				for (int i = 1; i <= 30; i++) {
					if (res & (1 << (i - 1)) && !flag) {
						printf("%d", i);
						flag = 1;
					}
					else if (res & (1 << (i - 1)))
						printf(" %d", i);
				}
				printf("\n");
			}
		}
	}
	return 0;
}