Color the ballTime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8617 Accepted Submission(s): 4407
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
Sample Output
|
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=100010;
int n,arr[N],level[N];
int lowbit(int x){
return x&(-x);
}
void update(int i,int val){
while(i<=n){
arr[i]+=val;
i+=lowbit(i);
}
}
int Sum(int i){
int ans=0;
while(i>0){
ans+=arr[i];
i-=lowbit(i);
}
return ans;
}
int main(){
//freopen("input.txt","r",stdin);
while(~scanf("%d",&n) && n){
memset(arr,0,sizeof(arr));
memset(level,0,sizeof(level));
int a,b;
for(int i=1;i<=n;i++){
scanf("%d%d",&a,&b);
update(a,1);
update(b+1,-1); //这两个函数刚好更新x~y之间的值都+1
}
for(int i=1;i<n;i++)
printf("%d ",Sum(i));
printf("%d\n",Sum(n));
}
return 0;
}
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<iomanip>
using namespace std;
const int inf=10000000;
int f[100005];
int main(){
int n;
while(scanf("%d",&n)!=EOF&&n){
memset(f,0,sizeof(f));
for(int i=0,a,b;i<n;++i){
scanf("%d%d",&a,&b);
f[a]++;
f[b+1]--;
}
cout<<f[1];
for(int i=2;i<=n;++i){
f[i]+=f[i-1];
cout<<' '<<f[i];
}
cout<<endl;
}
return 0;
}