线段树讲解

此讲解参考于B站的一位高产的UP主,链接是:线段树

同时也推荐你们B站看一下左程云老师的线段树,应该是讲解的最清楚的一位大佬了,同时代码模板也是最标准的

线段树的结构:





单点更新,区间查询的线段树代码:

#include<iostream>
#define maxSize 1001
using namespace std;
//单点更新，区间查询
void build_tree(int arr[], int tree[], int node, int start, int end) {
	if (start == end) {
		tree[node] = arr[start];
	}
	else{
		int mid = (start + end) / 2;
		int left_node = 2 * node + 1;
		int right_node = 2 * node + 2;
		build_tree(arr, tree, left_node, start, mid);
		build_tree(arr, tree, right_node, mid + 1, end);
		tree[node] = tree[left_node] + tree[right_node];
	}
}

void update_tree(int arr[], int tree[], int node, int start, int end, int idx, int val) {
	if (start == end) {
		tree[node] = val;
		arr[node] = val;
	}
	else {
		int mid = (start + end) / 2;
		int left_node = 2 * node + 1;
		int right_node = 2 * node + 2;
		if (idx >= start && idx <= mid)
			update_tree(arr, tree, left_node, start, mid, idx, val);
		else
			update_tree(arr, tree, right_node, mid + 1, end, idx, val);
		tree[node] = tree[left_node] + tree[right_node];
	}
}

int query_tree(int arr[], int tree[], int node, int start, int end, int L, int R) {
	if (R<start || L>end)
		return 0;
	else if (L <= start && R >= end)
		return tree[node];
	else if (start == end)
		return tree[node];
	int mid = (start + end) / 2;
	int left_node = 2 * node + 1;
	int right_node = 2 * node + 2;
	int sum_left = query_tree(arr, tree, left_node, start, mid, L, R);
	int sum_right = query_tree(arr, tree, right_node, mid + 1, end, L, R);
	return sum_left + sum_right;
}

int main() {
	int arr[] = { 1,3,5,7,9,11 };
	int size = 6;
	int tree[maxSize] = { 0 };

	build_tree(arr, tree, 0, 0, size - 1);
	int i;
	for (i = 0; i < 15; i++) {
		printf("tree[%d]=%d\n", i, tree[i]);
	}
	printf("\n");

	update_tree(arr, tree, 0, 0, size - 1, 4, 6);
	for (i = 0; i < 15; i++) {
		printf("tree[%d]=%d\n", i, tree[i]);
	}
	printf("\n");

	printf("sum = %d\n", query_tree(arr, tree, 0, 0, size - 1, 2, 5));

	system("pause");
	return 0;
}

线段树进阶代码:

#include<iostream>
#include<string>
using namespace std;

struct node
{
	int l, r, sum, tag;
};

node tree[1005];
int arr[1005];
int sum;
void pushUp(int idx) {
	tree[idx].sum = tree[(idx << 1) | 1].sum + tree[(idx << 1) + 2].sum;
}

void pushDown(int idx) {
	int val = tree[idx].tag;
	int mid = (tree[idx].l + tree[idx].r) >> 1;
	tree[(idx << 1) | 1].sum += (mid - tree[idx].l + 1)*val;
	tree[(idx << 1) + 2].sum += (tree[idx].r - mid)*val;
	tree[(idx << 1) | 1].tag += val;
	tree[(idx << 1) + 2].tag += val;
	tree[idx].tag = 0;
}

void build_tree(int l, int r, int idx) {
	tree[idx].l = l;
	tree[idx].r = r;
	if (l == r) {
		tree[idx].sum = arr[r];
	}
	else {
		int mid = (l + r) >> 1;
		build_tree(l, mid, (idx << 1) || 1);
		build_tree(mid + 1, r, (idx << 1) + 2);
		pushUp(idx);
	}
}

void query_tree(int l, int r, int idx) {
	if (l <= tree[idx].l&&r >= tree[idx].r)
		sum += tree[idx].sum;
	else {
		if (tree[idx].tag != 0)
			pushDown(idx);
		int mid = (tree[idx].l + tree[idx].r) >> 1;
		if (r <= mid)
			query_tree(l, r, (idx << 1) || 1);
		else if (l > mid)
			query_tree(l, r, (idx << 1) + 2);
		else {
			query_tree(l, r, (idx << 1) || 1);
			query_tree(l, r, (idx << 1) + 2);
		}
	}
}

void update_tree(int l, int r, int idx, int val) {
	if (l <= tree[idx].l&&r >= tree[idx].r) {
		tree[idx].sum += (tree[idx].r - tree[idx].l + 1)*val;
		tree[idx].tag += val;
	}
	else {
		if (tree[idx].tag != 0)
			pushDown(idx);
		int mid = (tree[idx].l + tree[idx].r) >> 1;
		if (r <= mid)
			update_tree(l, r, (idx << 1) | 1, val);
		else if (l > mid)
			update_tree(l, r, (idx << 1) + 2, val);
		else {
			update_tree(l, r, (idx << 1) | 1, val);
			update_tree(l, r, (idx << 1) + 2, val);
		}
		pushUp(idx);
	}
}

int main() {
	int n, m, l, r, val;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> arr[i];
	build_tree(0, n - 1, 0);
	for (int i = 0; i < m; i++) {
		string op;
		cin >> op;
		cin >> l; 
		cin >> r;
		if (op == "Q") {
			sum = 0;
			query_tree(l-1, r-1, 0);
			cout << sum << endl;
		}
		else {
			cin >> val;
			update_tree(l-1, r-1, 0, val);
		}
	}
	system("pause");
	return 0;
}