萌新求调悬棺

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, m;
long long a[maxn], T[maxn << 2], lazy[maxn << 2];
void bee(int id, int l, int r, int k){
    lazy[id] += k;
    T[id] += k * (r - l + 1);
}
void pushup(int id){
    T[id] = T[id << 1] + T[id << 1 | 1];
}
void pushdown(int id, int l, int r){
    int mid = l + r >> 1;
    bee(id << 1, l, mid, lazy[id]);
    bee(id << 1 | 1, mid + 1, r, lazy[id]);
    lazy[id] = 0;
}
void build(int id, int l, int r){
    if(l == r){
        T[id] = a[l];
        return;
    }
    int mid = l + r >> 1;
    build(id << 1, l, mid);
    build(id << 1 | 1, mid + 1, r);
    pushup(id);
}
void update(int id, int l, int r, int x, int y, int k){
    if(x <= l && r <= y){
        bee(id, l, r, k);
        return;
    }
    pushdown(id, l, r);
    int mid = l + r >> 1;
    if(x <= mid) update(id << 1, l, mid, x, y, k);
    if(y > mid) update(id << 1 | 1, mid + 1, r, x, y, k);
    pushup(id);
}
long long query(int id, int l, int r, int x, int y){
    if(x <= l && r <= y){
        return T[id];
    }
    pushdown(id, l, r);
    int mid = l + r >> 1;
    long long ans = 0;
    if(mid >= x) ans += query(id << 1, l, mid, x, y);
    if(mid < y) ans += query(id << 1 | 1, mid + 1, r, x, y);
    return ans;
}
int main(){
    scanf("%lld%lld", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    build(1, 1, n);
    for(int i = 1; i <= m; i++){
        long long op, x, y, k;
        scanf("%lld", &op);
        if(op == 1){
           scanf("%lld%lld%lld", &x, &y, &k);
           update(1, 1, n, x, y, k);
        }else{
            scanf("%lld%lld", &x, &y);
            printf("%lld\n", query(1, 1, n, x, y));
        }
    }
    return 0;
}

之前AC了，重新交莫名其妙MLE