Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24404 Accepted Submission(s): 11853
當N = 0,輸入結束。
樹狀數組的區間更新
#include<bits/stdc++.h>
#define maxn 100010
using namespace std;
int n;
int a[maxn];
int lowbit(int t)
{
return t&(-t);
}
void add(int r,int num)
{
int i=r;
while(i>0)
{
a[i]+=num;
i=i-lowbit(i);
}
}
int sum(int r)
{
int ans=0;
int i=r;
while(i<=n)
{
ans+=a[i];
i+=lowbit(i);
}
return ans;
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
memset(a,0,sizeof(a));
for(int i=1;i<=n;i++)
{
int x,y;
scanf("%d%d",&x,&y);
add(y,1);//先把y左邊的全部加一
add(x-1,-1);//再把多加的減去
}
for(int i=1;i<n;i++)
printf("%d ",sum(i));
printf("%d\n",sum(n));
}
return 0;
}