hdu 1556 Color the ball(前缀和 or 树状数组)

Color the ball

Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 51710    Accepted Submission(s): 23076

 

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

3 1 1 2 2 3 3 3 1 1 1 2 1 3 0

 

Sample Output

1 1 1 3 2 1

 

树状数组求区间的和

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
#define lowbit(x ) ((x)&(-x))
int tree[N] = { 0 };
void update(int x, int y) {
	while (x <= N) {
		tree[x] += y;
		x += lowbit(x);
	}
}
int sum(int x) {
	int ans = 0;
	while (x > 0) {
		ans += tree[x];
		x -= lowbit(x);
	}
	return ans;
}

int main() {
	int n;
	while (cin >> n, n) {
		memset(tree, 0, sizeof(tree));
		for (int i = 1; i <= n; i++) {
			int L, R;
			cin >> L >> R;
			update(L, 1);
			update(R + 1, -1);
		}
		for (int i = 1; i <= n; i++) {
			if (i != n) printf("%d ", sum(i));
			else printf("%d\n", sum(i));
		}
	}
	return 0;
}

前缀和求区间的和：

#include<bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N], D[N];
int main() {
	int n;
	while (cin >> n, n) {
		memset(a, 0, sizeof(a));
		memset(D, 0, sizeof(D));
		for (int i = 1; i <= n; i++) {
			int L, R;
			scanf("%d%d", &L, &R);
			D[L]++;
			D[R + 1]--;
		}
		for (int i = 1; i <= n; i++) {
			a[i] = a[i - 1] + D[i];
			if (i != n) printf("%d ", a[i]);
			else printf("%d\n", a[i]);
		}
	}
	return 0;
}