线段树1【模板】 70tps 后3点RE求调

#include<bits/stdc++.h>
#define int long long  
using namespace std;
const int N=1e5+5;
int n,m,a[N];
struct segtree
{
	int sum;
	int lazyadd;
	int L,R;
}tr[N<<2];
void pushup(int u)
{
	tr[u].sum=tr[u*2].sum+tr[u*2+1].sum;
} 
void pushdown(int u)
{
	if(tr[u].lazyadd == 0) return;
	int mid = (tr[u].L+tr[u].R)/2;
	tr[u<<1].sum += (mid-tr[u].L+1)*tr[u].lazyadd;
	tr[u<<1|1].sum += (tr[u].R-mid)*tr[u].lazyadd; 
	tr[u*2].lazyadd+=tr[u].lazyadd;
	tr[u*2+1].lazyadd+=tr[u].lazyadd;
	tr[u].lazyadd=0;
	return;
}
void build(int l,int r,int u)
{
	tr[u].L=l;
	tr[u].R=r;
	if(l==r) tr[u].sum=a[l];
	else
	{
		int mid=(l+r)>>1;
		build(l,mid,u*2);
		build(mid+1,r,u*2+1);
		tr[u].sum=tr[u*2].sum+tr[u*2+1].sum;
	}
}
void update(int u,int l,int r,int v)
{
	if(l<=tr[u].L&&tr[u].R<=r)
	{
		tr[u].lazyadd+=v;
		tr[u].sum+=(tr[u].R-tr[u].L+1)*v;
	}
	else
	{
		pushdown(u);
		int mid=(tr[u].L+tr[u].R)/2;
		if(l<=mid) update(u*2,l,r,v);
		if(r>mid) update(u*2+1,l,r,v);
		pushup(u);
	}
}
int query(int l,int r,int u)
{
	pushdown(u);
	if(l<=tr[u].L&&tr[u].R<=r) return tr[u].sum;
	int mid=(tr[u].R+tr[u].L)/2;
	int v=0;
	if(l<=mid) v+=query(l,r,u*2);
	if(r>mid) v+=query(l,r,u*2+1);
	return v; 
}
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	build(1,n,1);
	while(m--)
	{
		int t,x,y,k;
		cin>>t>>x>>y;
		if(t==1)
		{
			cin>>k;
			update(1,x,y,k);
		}
		else cout<<query(x,y,1)<<'\n';
	}
}