求助，用了懒标记，但还是超时了

#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int NR = 1e5 + 5;
int n,m,id,x,y,k,a[NR],tree[4 * NR],tag[4 * NR];
void pushup (int x){
    tree[x] = tree[(x << 1)] + tree[(x << 1) + 1];
    return ;
}
void addtag (int l,int r,int x,int val){
    tag[x] += val;
    tree[x] += (r - l + 1) * val;
    return ;
}
void pushdown (int l,int r,int x){
    if (tag[x] == 0) return ;
    int mid = l + r >> 1;
    addtag(l,mid,(x << 1),tag[(x << 1)]);
    addtag(mid + 1,r,(x << 1) + 1,tag[(x << 1) + 1]);
    tag[x] = 0;
    return ;
}
void build (int l,int r,int x){
    if (l == r){
        tree[x] = a[l];
        return ;
    }
    int mid = l + r >> 1;
    build(l,mid,(x << 1));
    build(mid + 1,r,(x << 1) + 1);
    pushup(x);
    return ;
}
int query (int l,int r,int x,int y,int cur){
    if (y < l || x > r) return 0;
    if (x <= l && r <= y) return tree[cur];
    pushdown(l,r,cur);
    int mid = l + r >> 1;
    return query(l,mid,x,y,(cur << 1)) + query(mid + 1,r,x,y,(cur << 1) + 1);
}
void update (int l,int r,int x,int y,int cur,int val){
    if (y < l || x > r) return ;
    if (l == r && x <= l && r <= y){
        addtag(l,r,cur,val);        
        return ;
    }
    pushdown(l,r,cur);
    int mid = l + r >> 1;
    update(l,mid,x,y,(cur << 1),val);
    update(mid + 1,r,x,y,(cur << 1) + 1,val);
    pushup(cur);
    return ;
}
signed main (){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for (int i = 1;i <= n; ++i) cin >> a[i];
    build (1,n,1);
    while (m--){
        cin >> id;
        if (id == 1){
            cin >> x >> y >> k; 
            update(1,n,x,y,1,k);
        }else{
            cin >> x >> y;
            cout << query (1,n,x,y,1) << '\n'; 
        }
    }
    return 0;
}