zoj 1610 Count the Colors

这道题目的代码需要学习线段树才可以看懂
因为线段树的组成结构 它从左向右的叶子节对应的区间是递增的
所以最后可以利用query和last标记来进行计数

#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 8010;
int  ans[maxn];
struct node {
	int l, r, color;
} tree[maxn << 2];

void build(int u, int l, int r) {
	tree[u] = { l, r, -1 };
	if (l == r) return;
	int mid = l + r >> 1;
	build(u << 1, l, mid);
	build(u << 1 | 1, mid + 1, r);
}

void push_down(int u) {
	if (tree[u].color == -1) return;
	tree[u << 1].color = tree[u].color;
	tree[u << 1 | 1].color = tree[u].color;
	tree[u].color = -1;
}

void modify(int u, int l, int r, int color) {
	if (tree[u].l >= l && tree[u].r <= r) {
		tree[u].color = color;
	} else {
		push_down(u);
		int mid = tree[u].l + tree[u].r >> 1;
		if (mid >= l) modify(u << 1, l, r, color);
		if (mid < r) modify(u << 1 | 1, l, r, color);
	}
}

void inti() {
	build(1, 0, 8000);
	memset(ans, 0, sizeof(ans));
}

int last;
void query(int u, int l, int r) {
	if (tree[u].l > r || tree[u].r < l)return;
	if (tree[u].l == tree[u].r || tree[u].color != -1) {
		if (last != tree[u].color) {
			last = tree[u].color;
			if (last != -1) ans[last]++;
		}
		return;
	}
	push_down(u);
	query(u << 1, l, r);
	query(u << 1 | 1, l, r);
}

int main() {
	int n, i, x1, x2, color, maxr, minl;

	while (scanf("%d", &n) != EOF) {
		inti();
		maxr = -1;
		minl = 8001;
		for (i = 0; i < n; i++) {
			scanf("%d%d%d", &x1, &x2, &color);
			maxr = max(maxr, x2);
			minl = min(minl, x1);
			modify(1, x1, x2 - 1, color);
		}

		last = -1;
		query(1, minl, maxr);

		for (i = 0; i <= 8000; i++) {
			if (ans[i])printf("%d %d\n", i, ans[i]);
		}
		printf("\n");
	}

}