Color the ball 树状数组水之

Color the ball

Time Limit:5000MS  Memory Limit:65536K
Total Submit:126 Accepted:53

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

View Code
#include<stdio.h>
#include
<string.h>
int n;
int c[100001];
int get_val()
{
int ret(0);
char c;
while((c=getchar())==''||c=='\n'||c=='\r');
ret
=c-'0';
while((c=getchar())!=''&&c!='\n'&&c!='\r')
ret
=ret*10+c-'0';
return ret;
}
int lowbit(int x)
{
return x&(-x);
}
int get_sum(int x)
{
int sum=0;
while(x>0)
{
sum
+=c[x];
x
-=lowbit(x);
}
return sum;
}
void add(int x,int val)
{
while(x<=n)
{
c[x]
+=val;
x
+=lowbit(x);
}
}
int main()
{
int a,b,i;
while(scanf("%d",&n)!=-1&&n)
{
memset(c,
0,sizeof(c));
for(i=1;i<=n;i++)
{
a
=get_val();b=get_val();
add(a,
1);
add(b
+1,-1);
}
printf(
"%d",get_sum(1));
for(i=2;i<=n;i++)
printf(
" %d",get_sum(i));
printf(
"\n");
}
return0;
}

  



posted @ 2011-08-29 15:37  Because Of You  Views(333)  Comments(0Edit  收藏  举报