HDOJ 1556 Color the ball

题意：给出n个区间，每次在区间a-b之间的所有值加一，最后求每个点的值

链接：http://acm.hdu.edu.cn/showproblem.php?pid=1556

思路：区间更新，单点查询，树状数组和线段树都可搞，考虑时间空间编码各种复杂度，还是选用树状数组搞之。

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
12571785	2014-12-23 21:37:31	Accepted	1556	702MS	1596K	1335 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;

int cnt[100005];
int n;

void add ( int x, int k )
{
    for ( ; x <= n; x += ( x & -x ) )
        cnt[x] += k;
}

int query ( int x )
{
    int ans = 0;
    for ( ; x > 0; x -= ( x & -x ) )
        ans += cnt[x];
    return ans;
}

int main()
{
    ios::sync_with_stdio( false );
    int t;
    while ( cin >> n && n )
    {
        int a, b;
        clr ( cnt, 0 );
        for ( int i = 0; i < n; i ++ )
        {
            cin >> a >> b;
            add ( a, 1 );
            add ( b + 1, -1 );
        }
        for ( int i = 1; i < n; i ++ )
        {
            cout << query ( i ) << ' ';
        }
        cout << query( n ) << endl;
    }
    return 0;
}