HDU-1556 Color the ball 简单树状数组

#include "stdio.h"
#include "string.h"
const int maxn = 100005;
int n;
int c[maxn];
int lowbit( int x )
{
	return x&(-x);
}
void add( int x,int ad )
{
	while( x <= n )
	{
		c[x] += ad;
		x += lowbit(x);
	}
}
int Sum( int x )
{
	int ans = 0;
	while( x >= 1 )
	{
		ans += c[x];
		x -= lowbit(x);
	}
	return ans;
}

int main()
{
	//freopen( "data.txt","r",stdin );
	int a,b;
	while( scanf("%d",&n) != EOF,n )
	{
		memset( c,0,sizeof(c) );
		for( int i = 0; i < n; i ++ )
		{
			scanf("%d%d",&a,&b);
			add( a,1 );			//树状数组是以点为更新 故要把区间后面的还原
			add( b+1,-1 );
		}
		for( int i=1; i<n; i++ )
		{
			printf("%d ",Sum(i));
		}
		printf("%d\n",Sum(n));
	}
	return 0;
}