线段树板子都没调过，帮帮我！

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 800010;
int n,m;
int a[N];
struct Node
{
	int l,r,tag,sum;
}t[N];
void pushup(int rt)
{
	t[rt].sum = t[rt<<1].sum+t[rt<<1|1].sum;
}
int cnt = 0;
void build(int rt,int l,int r)
{
	t[rt].l = l,t[rt].r = r; 
	int mid = (l+r) >> 1;
	if(l == r)
	{
		t[rt].sum = a[l]; 
		return;
	}
	build(rt<<1,l,mid),build(rt<<1|1,mid+1,r);
	pushup(rt);
}
void pushdown(int rt)
{
	if(t[rt].tag == 0/*上一层没有懒标记*/) return;
	int l = t[rt].l,r = t[rt].r,mid = (l+r) >> 1;
	t[rt<<1].sum += (mid-l+1)*t[rt].tag,t[rt<<1].tag += t[rt].tag;
	t[rt<<1|1].sum += (r-mid)*t[rt].tag,t[rt<<1|1].tag += t[rt].tag;
	t[rt].tag = 0; 
}

void updates(int rt,int start,int end,int x)//将start~end加上x
{
	int l = t[rt].l,r = t[rt].r,mid = (l+r)>>1;
	if(start<=l && r<=end)	//当前区间在修改区间里 
	{
		t[rt].sum += (r-l+1)*x;
		t[rt].tag += x;
		return;
	}
	pushdown(rt);
	if(start <= mid) updates(rt<<1,start,end,x);
	if(end > mid) updates(rt<<1|1,start,end,x);
	pushup(rt);
}
int query(int rt,int start,int end)//求和 
{
	if(start > end) return 0;
	int l = t[rt].l,r = t[rt].r,mid = (l+r)>>1;
	if(start<=l && r<=end) return t[rt].sum;
	pushdown(rt);
	int res = 0;
	if(start <= mid) query(rt<<1,start,end);
	if(end > mid) query(rt<<1|1,start,end);
	return res;
}
signed main()
{
	cin>>n>>m;
	for(int i=1; i<=n; i++) cin>>a[i];
	build(1,1,n);
	for(int i=1; i<=m; i++)
	{
		int op; cin>>op;
		if(op == 1)
		{
			int x,y,k; cin>>x>>y>>k;
			updates(1,x,y,k);
		}else
		{
			int x,y; cin>>x>>y;
			cout<<query(1,x,y)<<endl;
		}
	}
	return 0;	
}