90分求调

#include <bits/stdc++.h>
using namespace std;
int n,q,a[100005];
struct node
{
	int l,r;
	long long sum,tag;
}tree[100005 * 4];
void push_up(int rt)
{
	tree[rt].sum = tree[rt * 2].sum + tree[rt * 2 + 1].sum;
}
void push_down(int rt)
{
	if (!tree[rt].tag)
	{
		return;
	}
	tree[rt * 2].sum += tree[rt].tag * (tree[rt * 2].r - tree[rt * 2].l + 1);
	tree[rt * 2 + 1].sum += tree[rt].tag * (tree[rt * 2 + 1].r - tree[rt * 2  + 1].l + 1);
	tree[rt * 2].tag += tree[rt].tag;
	tree[rt * 2 + 1].tag += tree[rt].tag;
	tree[rt].tag = 0;
}

void build(int rt,int l,int r)
{
	tree[rt].l = l;
	tree[rt].r = r;
	if (l == r)
	{
		tree[rt].sum = a[l];
		return;
	}
	int mid = (l + r) / 2;
	build(rt * 2,l,mid);
	build(rt * 2 + 1,mid + 1,r);
	push_up(rt);
	return;
}
void upd(int rt,int x,int y,int d)
{
	if (x <= tree[rt].l && y >= tree[rt].r)
	{
		tree[rt].sum += (tree[rt].r - tree[rt].l + 1) * d;
		tree[rt].tag += d;
		return;
	}
	push_down(rt);
	int mid = (tree[rt].l + tree[rt].r) / 2;
	if (x <= mid)
	{
		upd(rt * 2,x,y,d);
	}
	if (y > mid)
	{
		upd(rt * 2 + 1,x,y,d);
	}
	push_up(rt);
	return;
}
long long qry_sum(int rt,int x,int y)
{
	if (x <= tree[rt].l && y >= tree[rt].r)
	{
		return tree[rt].sum;
	}
    push_down(rt);
	int mid = (tree[rt].l + tree[rt].r) / 2;
	long long ret = 0;
	if (x <= mid)
	{
		ret += qry_sum(rt * 2,x,y);
	}
	if (y > mid)
	{
		ret += qry_sum(rt * 2 + 1,x,y);
	}
	push_up(rt);
	return ret;
}

int main()
{
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	build(1,1,n);
	int opt,x,y,z;
	for (int i = 1; i <= q; i++)
	{
		cin >> opt;
		if (opt == 1)
		{
			cin >> x >> y >> k;
			upd(1,x,y,k);
		}
		else
		{
			cin >> x >> y;
			cout << qry_sum(1,x,y) << endl;
		}
	}
	return 0;
}