223. 练习题2：线段树模板(二)

题目描述

---

结果

• 建立线段树O(logn * n) 查找O(logn) 利用前缀和 回溯计算每个区间的和 求解区间和
• 区间修改需要用[lazy标记]

#include <iostream>
using namespace std;

struct node {
	int l, r, cnt; //cnt=r-l+1
	long long sum, lazy;
};

node tree[40005];
int n, m, num[10005];

inline void backtracking(int now) {
	tree[now].sum = tree[now * 2].sum + tree[now * 2 + 1].sum;
}

void builtTree(int now, int l, int r) {
	tree[now].l = l;
	tree[now].r = r;
	tree[now].cnt = r - l + 1;
	tree[now].lazy = 0; //修改操作时添加的标记
	if (l == r) { //只有一个元素
		tree[now].sum = num[l];
		return ;
	}

	int mid = (l + r) / 2;
	builtTree(now * 2, l, mid); //左子树建树 二叉树的左子树*2
	builtTree(now * 2 + 1, mid + 1, r); //右子树建树 二叉树的左子树*2+1

	//回溯每个节点的值
	backtracking(now);
}

void down_lazy(int now) {
	if (tree[now].lazy) {
		tree[now * 2].sum += tree[now * 2].cnt * tree[now].lazy; //左子树
		tree[now * 2 + 1].sum += tree[now * 2 + 1].cnt * tree[now].lazy; //右子树

		//lazy标记down
		tree[now * 2].lazy += tree[now].lazy;
		tree[now * 2 + 1].lazy += tree[now].lazy;
		tree[now].lazy = 0;
	}
}

void modify(int now, int l, int r, int v) {
	if (tree[now].l >= l && tree[now].r <= r) { //递归边界 结束条件
		tree[now].sum += (long long)tree[now].cnt * v;
		tree[now].lazy += v;
		return ;
	}
	down_lazy(now);
	int mid = (tree[now].l + tree[now].r) / 2;
	if (mid >= l) modify(now * 2, l, r, v);
	if (mid < r) modify(now * 2 + 1, l, r, v);
	backtracking(now);
}

long long query(int now, int l, int r) { //查找时间复杂度O(logn)
	if (tree[now].l >= l && tree[now].r <= r)  //递归边界 结束条件
		return tree[now].sum;
	down_lazy(now);
	int mid = (tree[now].l + tree[now].r) / 2;
	long long t = 0;
	if (mid >= l) t += query(now * 2, l, r);
	if (mid < r) t += query(now * 2 + 1, l, r);
	return t;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &num[i]);
	builtTree(1, 1, n); //时间复杂度O(logn * n)

	for (int i = 0; i < m; ++i) {
		int t, a, b, c;
		scanf("%d", &t);
		if (1 == t) { //修改操作
			scanf("%d%d%d", &a, &b, &c);
			modify(1, a, b, c);
		}
		else { //查询操作
			scanf("%d%d", &a, &b);
			printf("%lld", query(1, a, b));
		}
	}

	return 0;
}