95 pts RE on #19 求调

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
int n,m,a[maxn];
struct SegTree{
	ll s[maxn*4],add[maxn*4];
	ll lc(ll u){return u*2;}
	ll rc(ll u){return u*2+1;}
	void pushup(ll u){s[u]=s[lc(u)]+s[rc(u)];}
	void build(ll u,ll l,ll r){
		if(l==r){s[u]=a[l];return;}
		ll mid=(l+r)/2;
		build(lc(u),l,mid),build(rc(u),mid+1,r),pushup(u);
	}
	void pushtag(ll u,ll l,ll r,ll k){add[u]+=k,s[u]+=(r-l+1)*k;}
	void pushdown(ll u,ll l,ll r){
		ll mid=(l+r)/2;
		pushtag(lc(u),l,mid,add[u]),pushtag(rc(u),mid+1,r,add[u]),add[u]=0;
	}
	void modify(ll u,ll l,ll r,ll ql,ll qr,ll k){
		if(ql<=l&&r<=qr){pushtag(u,l,r,k);return;}
		pushdown(u,l,r);
		ll mid=(l+r)/2;
		if(ql<=mid) modify(lc(u),l,mid,ql,qr,k);
		if(qr>mid) modify(rc(u),mid+1,r,ql,qr,k);
		pushup(u);
	}
	ll query(ll u,ll l,ll r,ll ql,ll qr){
		if(ql<=l&&r<=qr) return s[u];
		pushdown(u,l,r);
		ll mid=(l+r)/2,ans=0;
		if(ql<=mid) ans+=query(lc(u),l,mid,ql,qr);
		if(qr>mid) ans+=query(rc(u),mid+1,r,ql,qr);
		pushup(u);
		return ans;
	}
}sgt;
int main(){
//	freopen("input.in","r",stdin);
//	freopen("My_output.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	sgt.build(1,1,n);
	while(m--){
		int op;cin>>op;
		if(op==1){
			ll l,r,k;cin>>l>>r>>k;
			sgt.modify(1,1,n,l,r,k);
		}else{
			ll l,r;cin>>l>>r;
			cout<<sgt.query(1,1,n,l,r)<<'\n';
		}
	}
}