码风良好，90，求调！

#include <bits/stdc++.h>

using namespace std;

const  int  N = 1e5 + 10;

typedef long long LL;

struct Node
{
	int l, r;
	LL sum, add;
}tr[N*4];

int n, m;
int w[N];

void pushup(int u)
{
	tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}

void pushdown(int u)
{
	auto &root = tr[u], &left = tr[u << 1], &right = tr[u << 1 | 1];
	if(root.add != 0)
	{
		left.add += root.add, left.sum += (LL)(left.r - left.l + 1) * root.add;
		right.add += root.add, right.sum += (LL)(right.r - right.l + 1) * root.add;
		root.add = 0;	
	} 
}

void build(int u, int l, int r)
{
	if(l == r) tr[u] = {l, r, w[l], 0};
	else
	{
		tr[u] = {l, r};
		int mid = l + r >> 1;
		build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}
}

void modify(int u, int l, int r, int d)
{
	if(tr[u].l >= l && tr[u].r <= r) 
	{
		tr[u].add += d;
		tr[u].sum += (LL)(tr[u].r - tr[u].l + 1) * d;
	}
	else
	{
		pushdown(u);
		int mid = tr[u].l + tr[u].r >> 1;
		if(l <= mid) modify(u << 1, l, mid, d);
		if(r > mid) modify(u << 1 | 1, mid + 1, r, d);
		pushup(u);
	}
}

LL query(int u, int l, int r)
{
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
	else
	{
		pushdown(u);
		LL sum = 0;
		int mid = tr[u].l + tr[u].r >> 1;
		if(l <= mid) sum += query(u << 1, l, mid);
		if(r > mid) sum += query(u << 1 | 1, mid + 1, r);
		return sum;
	}
}

int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    cin >> n >> m;
    for(int i = 1; i <= n; i ++) cin >> w[i];
    
    build(1, 1, n);
    
    int op;
    int x, y, k;
    while(m --)
    {
    	cin >> op;
    	if(op == 1)
    	{
    		cin >> x >> y >> k;
    		modify(1, x, y, k);
		}
		else if(op == 2)
		{
			cin >> x >> y;
			cout << query(1, x, y) << "\n";
		}
	}
    return 0;
}