HDU 1556 Color the ball

题解：基础的树状数组区间修改，单点查询。

#include <cstdio>
#include <cstring>
int c[100005],a,b,n;
int modify(int x,int num){while(x<=n)c[x]+=num,x+=x&-x;}
int query(int x){int s=0;while(x>0)s+=c[x],x-=x&-x;return s;} 
int main(){while(~scanf("%d",&n)&&n){memset(c,0,sizeof c);for(int i=0;i<n;i++){scanf("%d%d",&a,&b);modify(a,1); modify(b+1,-1);}for(int i=1;i<n;i++)printf("%d ",query(i));printf("%d\n",query(n));}return 0;
}