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
3
1 1
2 2
3 3
3
1 1
1 2
1 3
0
Sample Output
1 1 1
3 2 1
比较裸的模板题: 线段树+区间更新
#include<bits/stdc++.h>
using namespace std;
#define lid (id << 1)
#define rid (id << 1 | 1)
const int N = 100005;
int a[N];
struct Segtree{
int l, r;
int sum, mx;
int lazy;
}tr[N * 4];
void push_up(int id){
tr[id].sum = tr[rid].sum + tr[lid].sum;
//tr[id].mx = max(tr[rid].mx, tr[lid].mx);
}
void push_down(int id){
if(tr[id].lazy){
tr[lid].lazy += tr[id].lazy;
tr[rid].lazy += tr[id].lazy;
tr[lid].sum += tr[id].lazy * (tr[lid].r - tr[lid].l + 1);
tr[rid].sum += tr[id].lazy * (tr[rid].r - tr[rid].l + 1);
tr[id].lazy = 0;
}
}
void build(int id, int l, int r){
tr[id].l = l;
tr[id].r = r;
tr[id].lazy = 0;
tr[id].sum = 0;
if(l == r){
tr[id].sum = a[l];
return;
}
int mid = (l + r) >> 1;
build(lid, l, mid);
build(rid, mid + 1, r);
push_up(id);
}
void update(int id, int l, int r, int z){
if(tr[id].l == l && tr[id].r == r){
tr[id].sum += z * (tr[id].r - tr[id].l + 1);
tr[id].lazy += z;
return ;
}
push_down(id);
int mid = (tr[id].l + tr[id].r) >> 1;
if(r <= mid)
update(lid, l, r, z);
else if(l > mid)
update(rid, l, r, z);
else{
update(lid, l, mid, z);
update(rid, mid + 1, r, z);
}
push_up(id);
}
int query(int id, int l, int r){
if(tr[id].l == l && tr[id].r == r)
return tr[id].sum;
push_down(id);//区间查询的时候需要更新子节点
int mid = (tr[id].l + tr[id].r) >> 1;
if(r <= mid)
return query(lid, l, r);
if(l > mid)
return query(rid, l, r);
return query(lid, l, mid) + query(rid, mid + 1, r);
}
int main(){
int n;
while(scanf("%d", &n) != EOF){
if(n == 0)
break;
memset(a, 0, sizeof(a));
build(1, 1, n);
for(int i = 0; i < n; i++){
int x, y;
cin >> x >> y;
update(1, x, y, 1);
}
printf("%d", query(1, 1, 1));
for(int i = 2; i <= n; i++)
printf(" %d", query(1, i, i));
cout << endl;
}
return 0;
}