线段树

最新推荐文章于 2024-04-18 08:24:29 发布

shuara

最新推荐文章于 2024-04-18 08:24:29 发布

阅读量104

点赞数

本文链接：https://blog.csdn.net/shuara/article/details/105730021

版权

参考： https://www.bilibili.com/video/BV1cb411t7AM

建树

arr[] 原始数组， tree[] 线段树， node 树的下标， [ start , end] 树的节点表示的得失start到end的sum

void build_tree(int arr[], int tree[], int node, int start, int end){
	if(start == end){
		tree[node] = arr[start];
		return;
	}
	int mid = (start + end) / 2;
	int left_node = node * 2 + 1;
	int right_node = node * 2 + 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] = arr[idx] = val;
		return;
	}
	int mid = (start + end) / 2;
	int left_node = node * 2 + 1;
	int right_node = node * 2 + 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];
}

求 L->R 的 sum ${\color{Magenta} \sum_{i = L}^{R} arr[i]}$

int query_tree(int arr[], int tree[], int node, int start, int end, int L ,int R){
	//printf("start = %d\nend = %d\n", start, end);
	if(start > R || end < L){
		return 0;
	}
	if(start >= L && end <= R){
		return	tree[node];
	}
	int mid = (start + end) / 2;
	int left_node = node * 2 + 1;
	int right_node = node * 2 + 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;
}