/*
	Name: Segment Tree
	Copyright: 22/08/24 ~ 22/08/25
	Author: Gcc_Gdb_7_8_1
	Date: 22/08/24 12:17
	Description: P3372
*/
#include <cstdio>
#define lson(x) ((x) << 1)
#define rson(x) (((x) << 1) | 1)
#define len(x) (tree[x].right - tree[x].left + 1)
#define to(x, y) ((y) - (x) + 1)
#define mid(l, r) (((l) + (r)) >> 1)
#define mian main
#define viod void
#define ture true
#define flase false
typedef long long LL;

constexpr int MAXN = 1e5 + 10;

struct Node
{
	int left = 0, right = 0;
	LL value = 0LL, lazy = 0LL;
} tree[MAXN << 2];

LL a[MAXN];

viod build(int st, int en, int n) { // 构建线段树
	tree[n].left = st;
	tree[n].right = en;
	if (st == en) {
		tree[n].value = a[st];
		return ;
	}
	int mi = mid(st, en);
	build(st, mi, lson(n));
	build(mi + 1, en, rson(n));
	tree[n].value = tree[lson(n)].value + tree[rson(n)].value;
}

viod pushup(int n) { // 上传值
    tree[n].value = tree[lson(n)].value + tree[rson(n)].value;
}

void pushdown(int n){ // 下发lazy标记
    if (tree[n].lazy){
        tree[lson(n)].lazy  += tree[n].lazy;
        tree[rson(n)].lazy  += tree[n].lazy;
        tree[lson(n)].value += tree[n].lazy * len(lson(n));
        tree[rson(n)].value += tree[n].lazy * len(rson(n));
        tree[n].lazy = 0;
    }
}

viod update(int l, int r, int st, int en, int n, LL k) { // 将 [x, y]
	if (l <= st && en <= r) {
		tree[n].value += to(st, en) * k;
		tree[n].lazy  += k;
		return ;
	}
	int mi = mid(st, en);
	if (tree[n].lazy && st != en) {
		pushdown(n);
	}
	if (l <= mi) {
		update(l, r, st, mi, lson(n), k);
	}
	if (r > mi) {
		update(l, r, mi + 1, en, rson(n), k);
	}
	pushup(n);
}

LL query(int l, int r, int st, int en, int n) {
	if (l <= st && en <= r) {
		return tree[n].value;
	}
	int mi = mid(st, en);
	if (tree[n].lazy) {
		pushdown(n);
	}
	LL ans = 0;
	if (l <= mi) {
		ans = query(l, r, st, mi, lson(n));
	}
	if (r > mi) {
		ans += query(l, r, mi + 1, en, rson(n));
	}
	return ans;
}

int mian()
{
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
	}
	build(1, n, 1);
	while (m--) {
		int op, x, y;
		scanf("%d%d%d", &op, &x, &y);
		if (op == 1) {
		    LL k;
		    scanf("%lld", &k);
			update(x, y, 1, n, 1, k);
		} else {
			printf("%lld\n", query(x, y, 1, n, 1));
		}
	}
    return 0;
}

你康下这 update 和 pushdown 像吗（逻辑上）