注释:其中arr为数组,start为需要操作数组的左边界,end为右边界。tree为构造出的树状数组。node为当前的根节点。
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
using namespace std;
void build_tree(int arr[],int tree[],int node,int start,int end)
{
cout << start << endl;
if (start == end)
tree[node] = arr[start];
else
{
int leftnode = node * 2 + 1;
int rightnode = node * 2 + 2;
int mid = (start + end) / 2;
build_tree(arr, tree, leftnode, start, mid);
build_tree(arr, tree, rightnode, mid + 1, end);
tree[node] = tree[leftnode] + tree[rightnode];
}
}
void update_tree(int arr[], int tree[], int node, int start, int end, int index, int val)
{
if (start == end)
{
arr[index] = val;
tree[node] = val;
}
else
{
int mid = (start + end) / 2;
int leftnode = node * 2 + 1;
int rightnode = node * 2 + 2;
if (index >= start && index <= mid)
{
update_tree(arr, tree, leftnode, start, mid, index, val);
}
else
{
update_tree(arr, tree, rightnode, mid + 1, end, index, val);
}
tree[node] = tree[leftnode] + tree[rightnode];
}
}
int query_tree(int arr[], int tree[], int node, int start, int end, int L, int R)
{
cout << start << "*" <<end<< endl;
if (R<start || L>end)return 0;
else if (start == end)return tree[node];
else if (start >= L && end <= R)return tree[node];
else
{
int mid = (start + end) / 2;
int leftnode = node * 2 + 1;
int rightnode = node * 2 + 2;
int sumleft = query_tree(arr, tree, leftnode, start, mid, L, R);
int sumright = query_tree(arr, tree, rightnode, mid + 1, end, L, R);
return sumright + sumleft;
}
}
int main()
{
int arr[] = { 1,3,5,7,9,11 };
int size = 6;
int tree[MAX_LEN] = { 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);
int s = query_tree(arr, tree, 0, 0, size - 1, 2, 5);
cout << "s" << s << endl;
for (int i = 0; i < 15; i++)
cout << tree[i] << " tree" <<i<< endl;
return 0;
}