样例过不了 求条

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 5e5 + 50;
int n,m;
int arr[N];
int sum[N * 4],lzy[N * 4];

void up(int i){ //求和 
	sum[i] = sum[i << 1] + sum[i << 1 | 1];
}
void build(int l,int r,int i){ //建树
	lzy[i] = 0;
	if(l == r){
		sum[i] = arr[l];
		return ;
	}
	int mid = l + r >> 1;
	build(l,mid,i << 1);
	build(mid + 1,r,i << 1 | 1);
	up(i);
}
void lazy(int i,int v,int n){ //懒住 
	sum[i] += v * n;
	lzy[i] += v;
}
void down(int i,int ln,int rn){ //下发 
	if(lzy[i] != 0){
		lazy(i << 1,lzy[i],ln);
		lazy(i << 1 | 1,lzy[i],rn);
		lzy[i] = 0;
	}
}
void add(int jobl,int jobr,int jobv,int l,int r,int i){ //进行jobv 
	if(jobl <= l && r <= jobr){
		lazy(i,jobv,r - l + 1);
		return ;
	}
	int mid = l + r >> 1;
	down(i,mid - l + 1,r - mid);
	if(jobl <= mid) add(jobl,jobr,jobv,l,mid,i << 1);
	if(jobr > mid) add(jobl,jobr,jobv,mid + 1,r,i << 1 | 1);
	up(i);
}
int query(int jobl,int jobr,int l,int r,int i){ //查询 
	if(jobl <= l && r <= jobr){
		return sum[i];
	}	
	int mid = l + r >> 1;
	down(i,mid - l + 1,r - mid);
	int ans = 0;
	if(jobl <= mid) ans += query(jobl,jobr,l,mid,i << 1);
	else if(jobr > mid) ans += query(jobl,jobr,mid + 1,r,i << 1 | 1);
	return ans;
}

signed main(){
	cin>>n>>m;
	arr[0] = 0; 
	for(int i = 1;i <= n;i++) cin>>arr[i];
	build(1,n,1);
	for(int i = 1;i <= m;i++){
		int op,x,y;
		cin>>op>>x>>y;
		if(op == 1){
			int k;
			cin>>k;
			add(x,y,k,1,n,1);
		}else if(op == 2){
			cout<<query(x,y,1,n,1)<<endl;
		}
	}
	
	return 0;
}