Color the ball HDU - 1556 (线段树)

思路：线段树，区间更新

 #include<iostream>
 #include<vector>
 #include<string>
 #include<cmath>
 #include<set>
 #include<algorithm>
 #include<cstdio>
 #include<map>
 #include<cstring>
 #include<list>

 #define MAXSIZE 100010

 using namespace std;

 int tree[MAXSIZE*];
 int lz[MAXSIZE*];
 int N;
 int cnt = ;    // 控制输出的打印格式 

 void init()
 {
     memset(tree, , sizeof(tree));
     memset(lz, , sizeof(lz));
 }

 void build(int node, int l, int r)
 {
     if(l == r)
     {
         tree[node] = ;
         return;
     }
     int mid = (l+r)/;
     build(node*, l, mid);
     build(node*+, mid+, r);

     tree[node] = tree[node*] + tree[node*+];
 }

 void push_down(int node, int l, int r)
 {
     if(lz[node])
     {
         int mid = (l+r)/;
         lz[node*] += lz[node];
         lz[node*+] += lz[node];
         tree[node*] += (mid-l+)*lz[node];
         tree[node*+] += (r-mid)*lz[node];
         lz[node] = ;
     }
 }

 void update_range(int node, int l, int r, int L, int R, int add)
 {
     if(l <= L && r >= R)
     {
         lz[node] += add;
         tree[node] += (R-L+)*add;
         return;
     }

     push_down(node, L, R);
     int mid = (L+R)/;
     if(mid >= l)
         update_range(node*, l, r, L, mid, add);
     if(mid < r)
         update_range(node*+, l, r, mid+, R, add);

     tree[node] = tree[node*] + tree[node*+];
 }

 void print(int node, int l, int r)
 {
     if(l == r)
     {
         cnt++;
         printf("%d", tree[node]);
         if(cnt != N)
             printf(" ");
         else
             printf("\n");
         return;
     }
     push_down(node, l, r);    // 此处一定要记得push_down !
     int mid = (l+r)/;
     print(node*, l, mid);
     print(node*+, mid+, r);

 }

 int main()
 {    

     while(scanf("%d", &N) != EOF)
     {
         if(N == )
             break;
         init();
         build(, , N);
         for(int i = ; i < N; ++i)
         {
             int a, b;
             scanf("%d%d", &a, &b);
             update_range(, a, b, , N, );
         }
         cnt = ;
         print(, , N);
     }

     return ;
 }