线段树(单点修改)

参考视频
https://www.bilibili.com/video/BV1cb411t7AM

线段树功能
update(arr, i, val) 把arr[i]中的数字改成val
query(arr,L,R)计算数组arr中,从下标L到下标R之间的所有数字的和
朴素做法的update和query的复杂度只能做到一个为O(1)另一个为O(n)
通过线段树可以使update和query的复杂度都可以达到O(logn)

举例
arr = [1,3,5,7,9,11]
通过build生成线段树存储在build数组中
线段树如下图

通过update将arr[4] 即 9 修改成 6
修改后的线段树

query(arr,2,5) 返回arr[2] 到 arr[5] 的值为29

模板

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

const int MAX_LEN = 1000;

int arr[] = {1, 3, 5, 7, 9, 11};
int size = 6;
int tree[MAX_LEN] = {0};

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) >> 1;
        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) //update(arr, i, val) 把arr[i]中的数字改成val
{
    if(start == end)
    {
        tree[node] = val;
    }
    else
    {
        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, 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) //计算数组arr中,索引从L到R之间的所有数字的和(索引从0开始)
{
    if(R < start || L > end)
    {
        return 0;
    }
    else if(start >= L && end <= R) //注意这个边界,如果是子集可以直接返回
    {
        return tree[node];
    }
    else if(start == end)
    {
        return tree[node];
    }
    else
    {
        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()
{

    build_tree(arr, tree, 0, 0, size-1);

    for(int i = 0; i < 13; i++)
    {
        printf("%d ",tree[i]);
    }
    printf("\n");

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

    for(int i = 0; i < 13; i++)
    {
        printf("%d ",tree[i]);
    }
    printf("\n");

    int ans = query_tree(arr, tree, 0, 0, size-1, 2, 5);

    printf("%d",ans);
    return 0;
}