好的,下面是一份线段树的简单实现代码:
#include <stdio.h>
#include <stdlib.h>
#define MAX_N 100005
int n, m;
int nums[MAX_N];
int tree[MAX_N * 4];
void build_tree(int p, int l, int r) {
if (l == r) {
tree[p] = nums[l];
return;
}
int mid = (l + r) / 2;
build_tree(p * 2, l, mid);