Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6412 Accepted Submission(s):
3385
当N = 0,输入结束。
思路:树状数组
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
int map[100010];
int n;
int a,b;
int lowbit(int x)
{
return x & (-x);
}
void update(int position,int number)
{
for(int i = position;i <= n;i += lowbit(i))
map[i] += number;
}
int get(int position)
{
int sum = 0;
for(int i = position;i >= 1;i -= lowbit(i))
sum += map[i];
return sum;
}
int main()
{
while(scanf("%d",&n),n != 0)
{
memset(map,0,sizeof(map));
for(int i = 1;i <= n;i ++)
{
scanf("%d%d",&a,&b);
update(a,1);update(b + 1,-1);
}
for(int i = 1;i < n;i ++)
printf("%d ",get(i));
printf("%d
",get(n));
}
return 0;
}