Color the ball
Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13717 Accepted Submission(s): 6894
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
题目分析:基础区间更新
#include <cstdio>
#include <cstring>
#include <algorithm>
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
using namespace std;
int const MAX = 1e5 + 5;
int sum[MAX << 2], add[MAX << 2];
int n, la;
void PushUp(int rt)
{
sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}
void PushDown(int ln, int rn, int rt)
{
if(add[rt])
{
sum[rt << 1] += ln * add[rt];
sum[rt << 1 | 1] += rn * add[rt];
add[rt << 1] += add[rt];
add[rt << 1 | 1] += add[rt];
add[rt] = 0;
}
}
void Build(int l, int r, int rt)
{
add[rt] = 0;
if(l == r)
{
la = rt;
sum[rt] = 0;
return;
}
int mid = (l + r) >> 1;
Build(lson);
Build(rson);
PushUp(rt);
}
void Update(int L, int R, int c, int l, int r, int rt)
{
if(L <= l && r <= R)
{
sum[rt] += c * (r - l + 1);
add[rt] += c;
return;
}
int mid = (l + r) >> 1;
PushDown(mid - l + 1, r - mid, rt);
if(L <= mid)
Update(L, R, c, lson);
if(R > mid)
Update(L, R, c, rson);
PushUp(rt);
return;
}
void Output(int l, int r, int rt)
{
if(l == r)
{
printf("%d%c", sum[rt], (rt == la) ? '\n' : ' ');
return;
}
int mid = (l + r) >> 1;
PushDown(mid - l + 1, r - mid, rt);
Output(lson);
Output(rson);
}
int main()
{
while(scanf("%d", &n) != EOF && n)
{
Build(1, n, 1);
for(int i = 0; i < n; i++)
{
int l, r;
scanf("%d %d", &l, &r);
Update(l, r, 1, 1, n, 1);
}
Output(1, n, 1);
}
}