hdu 1556 Color the ball (技巧 || 线段树)

Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 28415 Accepted Submission(s): 13851

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

C/C++（线段树）：

 1 #include <map>
 2 #include <queue>
 3 #include <cmath>
 4 #include <vector>
 5 #include <string>
 6 #include <cstdio>
 7 #include <cstring>
 8 #include <climits>
 9 #include <iostream>
10 #include <algorithm>
11 #define INF 0x3f3f3f3f
12 using namespace std;
13 const int MAX = 5e5 + 10;
14 
15 int n, a, b;
16 
17 struct nod
18 {
19     int L, R, val;
20 }node[MAX];
21 
22 void build(int d, int l, int r)
23 {
24     node[d].L = l, node[d].R = r, node[d].val = 0;
25     if (l == r) return;
26     int mid = (l + r) >> 1;
27     build(d << 1, l, mid);
28     build((d << 1) + 1, mid + 1, r);
29 }
30 
31 void update(int d, int l, int r)
32 {
33     if (node[d].L == l && node[d].R == r)
34     {
35         node[d].val ++;
36         return;
37     }
38     if (node[d].L == node[d].R) return;
39     int mid = (node[d].L + node[d].R) >> 1;
40     if (r <= mid)
41         update(d << 1, l, r);
42     else if (mid < l)
43         update((d << 1) + 1, l, r);
44     else
45     {
46         update(d << 1, l, mid);
47         update((d << 1) + 1, mid + 1, r);
48     }
49 }
50 
51 int query(int d, int l, int r)
52 {
53     if (node[d].L == l && node[d].R == r) return node[d].val;
54     if (node[d].L == node[d].R) return 0;
55     int mid = (node[d].L + node[d].R) >> 1;
56     if (r <= mid)
57         return node[d].val + query(d << 1, l, r);
58     else if (mid < l)
59         return node[d].val + query((d << 1) + 1, l, r);
60     else
61         return node[d].val + query(d << 1, l, mid) + query((d << 1) + 1, mid + 1, r);
62 }
63 
64 int main()
65 {
66     while (scanf("%d", &n), n)
67     {
68         build(1, 1, n);
69         for (int i = 0; i < n; ++ i)
70         {
71             scanf("%d%d", &a, &b);
72             update(1, a, b);
73         }
74         for (int i = 1; i < n; ++ i)
75             printf("%d ", query(1, i, i));
76         printf("%d
", query(1, n, n));
77     }
78     return 0;
79 }

C/C++（技巧）：

 1 #include <map>
 2 #include <queue>
 3 #include <cmath>
 4 #include <vector>
 5 #include <string>
 6 #include <cstdio>
 7 #include <cstring>
 8 #include <climits>
 9 #include <iostream>
10 #include <algorithm>
11 #define INF 0x3f3f3f3f
12 using namespace std;
13 const int MAX = 1e5 + 10;
14 
15 int n, a, b;
16 
17 int main()
18 {
19     while (scanf("%d", &n), n)
20     {
21         int num[MAX] = {0}, m = 0;
22         for (int i = 1; i <= n; ++ i)
23         {
24             scanf("%d%d", &a, &b);
25             num[a] ++, num[b + 1] --;
26         }
27         for (int i = 1; i < n; ++ i)
28         {
29             m += num[i];
30             printf("%d ", m);
31         }
32         printf("%d
", m + num[n]);
33     }
34     return 0;
35 }