线段树

void build(int l,int r,int rt) {
    lazyp[rt]=0;
    lazym[rt]=1;
    if (l == r) {
        sum[rt] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void updata(int x,int d,int l,int r,int rt){
    if (l==r){
        sum[rt]+=d;
        return;
    }
    int mid=(l+r)>>1;
    updata(x,d,l,mid,rt<<1);
    updata(x,d,mid,r,rt<<1|1);
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void update(int l,int r,int d,int L,int R,int rt) {
    if (l <= L && R <= r) {
        sum[rt] += (r - l + 1) * d;
        lazy[rt] += d;
        return;
    }
    int mid = (l + r) >> 1;
    pushdown(mid - l + 1, r - mid, rt);
    if (l <= mid) updata(l, r, d, L, mid, rt << 1);
    if (r > mid) updata(l, r, d, mid+1, R, rt << 1 | 1);
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void update(int l,int r,int d,int L,int R,int rt) {
    if (l <= L && R <= r) {
        sum[rt] *=d;
        lazym[rt] *=d;
        lazyp[rt]*=d
        return;
    }
    int mid = (l + r) >> 1;
    pushdown(mid - l + 1, r - mid, rt);
    if (l <= mid) updata(l, r, d, L, mid, rt << 1);
    if (r > mid) updata(l, r, d, mid+1, R, rt << 1 | 1);
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void update(int l,int r,int d,int L,int R,int rt) {
    if (l <= L && R <= r) {
        sum[rt] += (r - l + 1) * d;
        lazyp[rt] += d;
        return;
    }
    int mid = (l + r) >> 1;
    pushdown(mid - l + 1, r - mid, rt);
    if (l <= mid) updata(l, r, d, L, mid, rt << 1);
    if (r > mid) updata(l, r, d, mid+1, R, rt << 1 | 1);
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void pushdown(int l,int r,int rt) {
    if (lazy[rt] == 0) {
        return;
    }
    lazy[rt << 1] += lazy[rt];
    lazy[rt << 1 | 1] += lazy[rt];
    lazy[rt] = 0;
    sum[rt << 1] += lazy[rt << 1] * l;
    sum[rt << 1 | 1] += lazy[rt << 1 | 1] * r;
}

void pushdown(int l,int r,int rt) {
    if (lazyp[rt]==0&&lazym[rt]==1){
        return;
    }
    sum[rt<<1]=(sum[rt<<1]*lazym[rt]+lazyp[rt]*l);
    sum[rt<<1|1]=(sum[rt<<1|1]*lazym[rt]+lazyp[rt]*l);

    lazym[rt << 1] =lazym[rt<<1]*lazym[rt];
    lazym[rt << 1|1] =lazym[rt<<1|1]*lazym[rt];

    lazyp[rt << 1] =lazyp[rt<<1]*lazym[rt]+lazyp[rt];
    lazyp[rt << 1|1] =lazyp[rt<<1|1]*lazym[rt]+lazyp[rt];

    lazyp[rt]==0;
    lazym[rt]==1;
}

int query(int l,int r,int L,int R,int rt) {
    if (l <= L && R <= r) {
        return sum[rt];
    }
    int mid = (l + r) >> 1;
    int ret = 0;
    pushdown(mid - l + 1, r - mid, rt);
    if (l <= mid) ret += query(l, r, L, mid, rt << 1);
    if (r > mid) ret += query(l, r, mid + 1, R, rt << 1 | 1);
    return ret;
}