Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24378 Accepted Submission(s): 11841
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
#include<bits/stdc++.h>
using namespace std;
const int MAX = 4e5 + 7;
int a[MAX], lazy[MAX];
void Update(int rt, int l, int r, int x, int y, int val)
{
if(x <= l && y >= r)
{
a[rt] += val * (r - l + 1);
lazy[rt] += val;
return;
}
if(lazy[rt])
{
lazy[rt << 1] += lazy[rt];
lazy[rt << 1 | 1] += lazy[rt];
a[rt << 1] += ((l + r) / 2 - l + 1) * lazy[rt];
a[rt << 1 | 1] += (r - (l + r) / 2) * lazy[rt];
lazy[rt] = 0;
}
int mid = (l + r) >> 1;
if(mid >= x)
Update(rt << 1, l, mid, x, y, val);
if(mid < y)
Update(rt << 1 | 1, mid + 1, r, x, y, val);
a[rt] = a[rt << 1] + a[rt << 1 | 1];
}
int Query(int rt, int l, int r, int x, int y)
{
if(x <= l && y >= r)
return a[rt];
if(lazy[rt])
{
lazy[rt << 1] += lazy[rt];
lazy[rt << 1 | 1] += lazy[rt];
a[rt << 1] += ((l + r) / 2 - l + 1) * lazy[rt];
a[rt << 1 | 1] += (r - (l + r) / 2) * lazy[rt];
lazy[rt] = 0;
}
int mid = (l + r) >> 1;
int sum = 0;
if(mid >= x)
sum += Query(rt << 1, l, mid, x, y);
if(y > mid)
sum += Query(rt << 1 | 1, mid + 1, r, x, y);
return sum;
}
int main()
{
ios::sync_with_stdio(false);
int n;
while(cin >> n && n)
{
memset(a, 0, sizeof a);
memset(lazy, 0, sizeof lazy);
for(int i = 0, x, y; i < n; i++)
{
cin >> x >> y;
Update(1, 1, n, x, y, 1);
}
cout << Query(1, 1, n, 1, 1);
for(int i = 2; i <= n; i++)
cout << " " << Query(1, 1, n, i, i);
cout << endl;
}
return 0;
}