HDU 1556 Color the ball (线段树)

最新推荐文章于 2019-05-12 18:42:24 发布

达达Mr_X

最新推荐文章于 2019-05-12 18:42:24 发布

阅读量327

点赞数

本文链接：https://blog.csdn.net/dadamr_x/article/details/51615730

版权

Problem Description

N个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a <= b),lele便为骑上他的“小飞鸽"牌电动车从气球a开始到气球b依次给每个气球涂一次颜色。但是N次以后lele已经忘记了第I个气球已经涂过几次颜色了，你能帮他算出每个气球被涂过几次颜色吗？

Input

每个测试实例第一行为一个整数N,(N <= 100000).接下来的N行，每行包括2个整数a b(1 <= a <= b <= N)。
当N = 0，输入结束。

Output

每个测试实例输出一行，包括N个整数，第I个数代表第I个气球总共被涂色的次数。

Sample Input

Sample Output

#include <cstdio>
#include <cstring>
#define N 100010
struct node
{
	int l, r, s, lazy;
} tree[4 * N];
int fa[N];
int n, a, b;
inline int L(int x){ return x << 1; }
inline int R(int x){ return (x << 1) + 1; }
inline int P(int x){ return x >> 1; }
void build(int i, int left, int right)
{
	tree[i].l = left; tree[i].r = right;
	tree[i].s = 0; tree[i].lazy = 0;
	if (left == right)
	{
		fa[left] = i;
		return;
	}
	int mid = left + (right - left) / 2;
	build(L(i), left, mid);
	build(R(i), mid + 1, right);
}
void push(int i)
{
	if (!tree[i].lazy) return;
	tree[L(i)].s += (tree[L(i)].r - tree[L(i)].l + 1) * tree[i].lazy;
	tree[L(i)].lazy += tree[i].lazy;
	tree[R(i)].s += (tree[R(i)].r - tree[R(i)].l + 1) * tree[i].lazy;
	tree[R(i)].lazy += tree[i].lazy;
	tree[i].lazy = 0;
}
void update(int i, int left, int right, int key)
{
	if (left <= tree[i].l && right >= tree[i].r)
	{
		tree[i].s += (tree[i].r - tree[i].l + 1) * key;
		tree[i].lazy += key;
		return;
	}
	push(i);
	int mid = tree[i].l + (tree[i].r - tree[i].l) / 2;
	if (left <= mid) update(L(i), left, right, key);
	if (right > mid) update(R(i), left, right, key);
	tree[i].s = tree[L(i)].s + tree[R(i)].s;
}
int query(int i, int left, int right)
{
	if (left <= tree[i].l && right >= tree[i].r) return tree[i].s;
	push(i);
	int sum = 0;
	int mid = tree[i].l + (tree[i].r - tree[i].l) / 2;
	if (left <= mid) sum += query(L(i), left, right);
	if (right > mid) sum += query(R(i), left, right);
	return sum;
}
int main()
{
	while (scanf("%d", &n), n)
	{
		build(1, 1, n);
		for (int i = 1; i <= n; i++)
		{
			scanf("%d%d", &a, &b);
			update(1, a, b, 1);
		}
		for (int i = 1; i < n; i++) 
			printf("%d ", query(1, i, i));
		printf("%d\n", query(1, n, n));
	}
	return 0;
}