线段树 区间更新模板

测试题目:HDU 1166,HDU 1394

/** 线段树模板 */
/** 以求区间和为例 */
#define lson rt << 1 , l ,mid
#define rson rt << 1 | 1,mid + 1,r
const int maxn = 50000 + 50;
int v[maxn << 2],laze[maxn << 2];
int A[maxn];

// 向下Push laze标记
void PushDown(int rt,int l,int r){
    if(laze[rt]){
        int mid = l + r >> 1,lcnt = mid - l + 1,rcnt = r - mid;
        v[rt << 1] = v[rt << 1] + lcnt * laze[rt];
        v[rt << 1 | 1] = v[rt << 1 | 1] + rcnt * laze[rt];
        laze[rt << 1] += laze[rt];laze[rt << 1 | 1] += laze[rt];
        laze[rt] = 0;
    }
}
//向上更新sum值
void PushUp(int rt){
    v[rt] = v[rt << 1] + v[rt << 1 | 1];
}
void Build(int rt,int l,int r){
    if(l == r){
        v[rt] = A[l];return;
    }
    int mid = l + r >> 1;
    Build(lson),Build(rson);
    laze[rt] = 0;
    PushUp(rt);
}

//将区间L,R 增加X
void Update(int rt,int l,int r,int L,int R,int x){
    if(L <= l && R >= r){
        v[rt] += x * (r - l + 1);
        laze[rt] += x;
        return;
    }
    PushDown(rt,l,r);
    int mid = l + r >> 1;
    if(L <= mid) Update(lson,L,R,x);
    if(R > mid) Update(rson,L,R,x);
    PushUp(rt);
}

int Query(int rt,int l,int r,int L,int R){
    if(L <= l && R >= r){
        return v[rt];
    }
    PushDown(rt,l,r);
    int mid = l + r >> 1;
    int ret = 0;
    if(L <= mid) ret += Query(lson,L,R);
    if(R > mid) ret += Query(rson,L,R);
    PushUp(rt);
    return ret;
}