数据结构 线段树 (Segment tree)

1. 线段树与树状数组

线段树将每个长度不为1的区间划分成左右两个区间递归求解，把整个线段划分为一个树形结构，通过合并左右两区间信息来求得该区间的信息。这种数据结构可以方便的进行大部分的区间操作。

树状数组和线段树具有相似的功能，但他俩毕竟还有一些区别：树状数组能有的操作，线段树一定有；线段树有的操作，树状数组不一定有。但是树状数组的代码要比线段树短，思维更清晰，速度也更快，在解决一些单点修改的问题时，树状数组是不二之选。

对于数组 arr={1,3,5,7,9,11} 有：

图片来源：线段树 Segment Tree - 正月点灯笼

2. 线段树的构建

void build_tree(int arr[], int tree[], int node, int start, int end) {
    if (start == end) {
        tree[node] = arr[start];
        return;
    }

    int min = (start + end) >> 1;
    int left_node = node * 2 + 1;
    int right_node = node * 2 + 2;

    build_tree(arr, tree, left_node, start, min);
    build_tree(arr, tree, right_node, min + 1, end);
    tree[node] = tree[left_node] + tree[right_node];
}

3. 线段树的更新

void update_tree(int arr[], int tree[], int node, int start, int end, int idx, int value) {
    if (start == end) {
        tree[node] = arr[idx] = value;
        return;
    }

    int mid = (start + end) >> 1;
    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, value);
    } else {
        update_tree(arr, tree, right_node, mid + 1, end, idx, value);
    }
    tree[node] = tree[left_node] + tree[right_node];
}

4. 线段树的查询

int query_tree(int arr[], int tree[], int node, int start, int end, int L, int R) {
    if (start > R || end < L) {
        return 0;
    } else if (L <= start && end <= R) {
        return tree[node];
    }

    int mid = (start + end) >> 1;
    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;
}

5. 总体代码

#include<bits/stdc++.h>

#define MAXN 1000
using namespace std;

void build_tree(int arr[], int tree[], int node, int start, int end) {
    if (start == end) {
        tree[node] = arr[start];
        return;
    }

    int min = (start + end) >> 1;
    int left_node = node * 2 + 1;
    int right_node = node * 2 + 2;

    build_tree(arr, tree, left_node, start, min);
    build_tree(arr, tree, right_node, min + 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 value) {
    if (start == end) {
        tree[node] = arr[idx] = value;
        return;
    }

    int mid = (start + end) >> 1;
    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, value);
    } else {
        update_tree(arr, tree, right_node, mid + 1, end, idx, value);
    }
    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 (start > R || end < L) {
        return 0;
    } else if (L <= start && end <= R) {
        return tree[node];
    }

    int mid = (start + end) >> 1;
    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;
}

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

    for (int i = 0; i < 15; ++i) {
        cout << "tree[" << i << "]=" << tree[i] << endl;
    }

    update_tree(arr, tree, 0, 0, size - 1, 4, 6);

    for (int i = 0; i < 15; ++i) {
        cout << "tree[" << i << "]=" << tree[i] << endl;
    }

    cout << "s = " << query_tree(arr, tree, 0, 0, size - 1, 2, 5) << endl;

    return 0;
}

参考资料：

[1] 线段树 Segment Tree - 正月点灯笼

[2] 树状数组 - OI Wiki