线段树模板1

功能

连续区间加
连续区间和

//#pragma warning(disable:4996)
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
#define LL long long

const int maxn = 111111;
LL add[maxn << 2];
LL sum[maxn << 2];

// PushUP(int rt)是把当前结点的信息更新到父结点
// PushDown(int rt)是把当前结点的信息更新给儿子结点
void PushUp(int rt) {			
	sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
}

void PushDown(int rt, int m) {			
	if (add[rt]) {
		add[rt << 1] += add[rt];
		add[rt << 1 | 1] += add[rt];
		sum[rt << 1] += add[rt] * (m - (m >> 1));
		sum[rt << 1 | 1] += add[rt] * (m >> 1);
		add[rt] = 0;
	}
}
//初始化
void build(int l, int r, int rt) {
	add[rt] = 0;
	if (l == r) {
		scanf("%lld", &sum[rt]);
		return;
	}
	int m = (l + r) >> 1;
	build(lson);
	build(rson);
	PushUp(rt);
}
//区间加
void update(int L, int R, int c, int l, int r, int rt) {
	if (L <= l && r <= R) {
		add[rt] += c;
		sum[rt] += (LL)c * (r - l + 1);
		return;
	}
	PushDown(rt, r - l + 1);
	int m = (l + r) >> 1;
	if (L <= m) update(L, R, c, lson);
	if (m < R) update(L, R, c, rson);
	PushUp(rt);
}
//区间和
LL query(int L, int R, int l, int r, int rt) {
	if (L <= l && r <= R) {
		return sum[rt];
	}
	PushDown(rt, r - l + 1);
	int m = (l + r) >> 1;
	LL ret = 0;
	if (L <= m) ret += query(L, R, lson);
	if (m < R) ret += query(L, R, rson);
	return ret;
}

int main() {
	int N, Q;
	scanf("%d%d", &N, &Q);
	build(1, N, 1);
	while (Q--) {
		int op;
		int a, b, c;
		scanf("%d", &op);
		if (op == 1) {
			scanf("%d%d%d", &a, &b, &c);
			update(a, b, c, 1, N, 1);
		}
		else {
			scanf("%d%d", &a, &b);
			printf("%lld
", query(a, b, 1, N, 1));
		}

	}

	return 0;

}