Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 32020 Accepted Submission(s): 15501
Problem 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
Author
8600
Source
HDU 2006-12 Programming Contest
Recommend
区间插入用add(l,1); add(r,-1);
#include<iostream>
#include<cmath>
#include<cstring>
using namespace std;
#define range 100005
int n;
int a[range];
int lowbit(int x)
{
return x&(-x);
}
int add(int i,int x)
{
while(i<=n)
{
a[i]+=x;
i=i+lowbit(i);
}
}
int sum(int i)
{
int sum=0;
while(i>0)
{
sum+=a[i];
i=i-lowbit(i);
}
return sum;
}
int main()
{
while(~scanf("%d",&n)&&n)
{
memset(a,0,sizeof(a));
int i,a,b;
for(i=0;i<n;i++)
{
scanf("%d %d",&a,&b);
add(a,1);
add(b+1,-1);
}
for(i=1;i<n;i++)
{
printf("%d ",sum(i));
}
printf("%d\n",sum(n));
}
return 0;
}