线段树模板题01

最新推荐文章于 2024-11-01 17:00:11 发布

南去良鱼

最新推荐文章于 2024-11-01 17:00:11 发布

阅读量44

点赞数

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/m0_74092885/article/details/132193010

版权

//线段树
#include <iostream>
using namespace std;
const int N = 100010;
long long a[N];

struct Node {
	long long l;
	long long r;
	long long sum;
	long long lazy;
} tr[N * 4];

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

void build(long long u, long long l, long long r) {
	tr[u].l = l;
	tr[u].r = r;
	if (l == r) {
		tr[u].sum = a[l];
		return ;
	}
	long long mid = l + r >> 1;
	build(u << 1, l, mid);
	build(u << 1 | 1, mid + 1, r);
	pushup(u);
}

void pushdown(long long u) {
	if (tr[u].lazy) {
		tr[u << 1].lazy += tr[u].lazy;
		tr[u << 1].sum += (tr[u << 1].r - tr[u << 1].l + 1) * tr[u].lazy;
		tr[u << 1 | 1].lazy += tr[u].lazy;
		tr[u << 1 | 1].sum += (tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1) * tr[u].lazy;
		tr[u].lazy = 0;
	}
}

//区间修改
void modify(long long u, long long l, long long r, long long k) {
	if (l <= tr[u].l && r >= tr[u].r) {
		tr[u].lazy += k;
		tr[u].sum += (tr[u].r - tr[u].l + 1) * k;
		return;
	}
	pushdown(u);
	long long mid = tr[u].l + tr[u].r >> 1;
	if (l <= mid)
		modify(u << 1, l, r, k);
	if (r > mid)
		modify(u << 1 | 1, l, r, k);
	pushup(u);
}

//区间查询
long long query(long long u, long long l, long long r) {
	if (l <= tr[u].l && r >= tr[u].r) {
		return tr[u].sum;
	}
	pushdown(u);
	long long mid = tr[u].l + tr[u].r >> 1;
	long long res = 0;
	if (l <= mid)
		res += query(u << 1, l, r);
	if (r > mid)
		res += query(u << 1 | 1, l, r);
	return res;
}

int main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(false);
	long long n, m;
	cin >> n >> m;

	for (long long i = 1; i <= n; i++) {
		cin >> a[i];
		//	scanf("%d", &a[i]);
	}
	build(1, 1, n);
	for (long long i = 1; i <= m; i++) {
		long long t;
		cin >> t;
		if (t == 1) {
			long long l, r;
			long long k;
			cin >> l >> r >> k;
			modify(1, l, r, k);
		} else {
			long long l, r;
			cin >> l >> r;
			cout << query(1, l, r) << endl;
		}
	}

	return 0;
}