HDOJ 1556 Color the ball 线段树 ： 成段更新 单点查询

//HDOJ 1556 Color the ball  线段树 ： 成段更新 单点查询/* 题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1556题目大意：ｎ（ｎ<=100000）个气球从左到右排列，每次在[a,b]区间上涂一次颜色，ｍ次操作后，问第ｉ个气球一共被涂过几次颜色。思路：成段更新*/#include<stdio.h>#include<string.h>#define N 100005int sum[N<<2];int add[N<<2];void PushUp(int rt){    sum[rt] = sum[rt<<1] + sum[rt<<1|1];}void PushDown(int rt,int m){    if(add[rt]){        add[rt<<1]   += add[rt];        add[rt<<1|1] += add[rt];        sum[rt<<1]   += add[rt] * (m - (m>>1));        sum[rt<<1|1] += add[rt] * (m>>1);        add[rt] = 0;    }}void update(int rt,int l,int r,int L,int R){    if(L <= l && R >= r){        add[rt] += 1;        sum[rt] += (r-l+1);        return;    }    PushDown(rt,r-l+1);    int mid = (r+l)>>1;    if(L <= mid) update(rt<<1,l,mid,L,R);    if(R > mid ) update(rt<<1|1,mid+1,r,L,R);    PushUp(rt);}int query(int rt,int l,int r,int L){    int R = L;    if(L <= l && R >= r){        return sum[rt];    }    PushDown(rt,r-l+1);    int mid = (r+l)>>1;    int res = 0;    if(L <= mid) res += query(rt<<1,l,mid,L);    if(R > mid ) res += query(rt<<1|1,mid+1,r,L);    return res;}int main(){    int n,i;    int a,b;    while(scanf("%d",&n),n){        memset(sum,0,sizeof(sum));        memset(add,0,sizeof(add));        for(i = 1; i <= n; ++i){            scanf("%d %d",&a,&b);            update(1,1,n,a,b);        }        printf("%d",query(1,1,n,1));        for(i = 2; i <= n; ++i)            printf(" %d",query(1,1,n,i));        printf("\n");    }    return 0;}