Color the ball
Time Limit : 9000/3000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 91 Accepted Submission(s) : 48
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,输入结束。
当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
方法一(树状数组):
#include<stdio.h>
#include<string.h>
int a[100000 + 5],n;
int Lowbit(int t)
{
return t&(-t);
}
int Sum(int p)
{
int sum = 0;
while (p > 0)
{
sum += a[p];
p -= Lowbit(p);
}
return sum;
}
void Updata(int p, int num)
{
while (p <=n+1)
{
a[p] += num;
p += Lowbit(p);
}
}
int main()
{
int L,R;
int i,sum;
while(scanf("%d", &n)!=EOF&&n!=0)
{
memset(a, 0, (n+1)*4);
for (i = 1; i <= n; i++)
{
scanf("%d%d", &L, &R);
Updata(L,1);
Updata(R+1,-1);
}
for (i = 1; i <= n -1; i++)
{
printf("%d ", Sum(i));
}
printf("%d\n",Sum(i));
}
return 0;
}
方法二:
#include<stdio.h>
#include<string.h>
int a[100000 + 5];
int main()
{
int n,L,R;
int i,sum;
while(scanf("%d", &n)!=EOF&&n!=0)
{
memset(a, 0, (n+1)*4);
for (i = 1; i <= n; i++)
{
scanf("%d%d", &L, &R);
a[L]++;
a[R+1]--;
}
sum=0;
for (i = 1; i <= n -1; i++)
{
sum+=a[i];
printf("%d ", sum);
}
printf("%d\n",sum+a[n]);
}
return 0;
}