RE #19。

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
typedef long long LL;
typedef unsigned int UI;
typedef unsigned long long ULL;
typedef __int128 big;
int n,m,a[N];
struct SegmentTree
{
	int l,r;
	LL add,sum;
	#define l(p) tr[p].l
	#define r(p) tr[p].r
	#define add(p) tr[p].add
	#define sum(p) tr[p].sum
}tr[N<<2];
inline int ls(int x){return x<<1;}
inline int rs(int x){return x<<1|1;}
inline void build(int p,int l,int r)
{
	l(p)=l,r(p)=r;
	if(l==r)
	{
		sum(p)=a[l];
		return;
	}
	int mid=l+((r-l)>>1);
	build(ls(p),l,mid);
	build(rs(p),mid+1,r);
	sum(p)=sum(ls(p))+sum(rs(p));
}
inline void spread(int p)
{
	if(add(p)==0) return;
	sum(ls(p))+=add(p)*(r(ls(p))-l(ls(p))+1);
	sum(rs(p))+=add(p)*(r(rs(p))-l(rs(p))+1);
	add(ls(p))+=add(p);
	add(rs(p))+=add(p);
	add(p)=0;
}
inline void Add(int p,int l,int r,LL k)
{
	if(l<=l(p)&&r(p)<=r)
	{
		add(p)+=k;
		sum(p)+=k*(r(p)-l(p)+1);
		return;
	}
	spread(p);
	int mid=l(p)+((r(p)-l(p))>>1);
	if(l<=mid) Add(ls(p),l,r,k);
	if(mid<r) Add(rs(p),l,r,k);
	sum(p)=sum(ls(p))+sum(rs(p));
}
inline LL query(int p,int l,int r)
{
	if(l<=l(p)&&r(p)<=r) return sum(p);
	spread(p);
	int mid=l(p)+((r(p)-l(p))>>1);
	LL ans=0;
	if(l<=mid) ans+=query(ls(p),l,r);
	if(mid<r) ans+=query(rs(p),l,r);
	return ans;
}
int 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,1,n);
	while(m--)
	{
		int type,l,r;cin>>type>>l>>r;
		if(type==1)
		{
			LL k;cin>>k;
			Add(1,l,r,k);
		}
		else cout<<query(1,l,r)<<'\n';
	}
	return 0;
}