由Leetcode衍生简单线段树

创建线段树；
查询某一段元素和；
更新某一个值。

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <functional>
using namespace std;


template <class T>
class SegmentTree {
public:
	SegmentTree(vector<T>& nums) {
		if (nums.size() == 0) {
			return;
		}
		tree = vector<T>(4 * nums.size(), 0);
		data.assign(nums.begin(), nums.end());
		BuildSegmentTree(0, 0, data.size() - 1);
	}
	void BuildSegmentTree(int TreeIndex, int left, int right) {
		if (left == right) {
			tree[TreeIndex] = data[left];
			return;
		}
		int LeftTreeIndex = 2 * TreeIndex + 1;
		int RightTreeIndex = 2 * TreeIndex + 2;
		int mid = left + (right - left) / 2;
		BuildSegmentTree(LeftTreeIndex, left, mid);
		BuildSegmentTree(RightTreeIndex, mid + 1, right);
		tree[TreeIndex] = tree[LeftTreeIndex] + tree[RightTreeIndex];
	}

	void set(int i, T val) {
		if (i<0 || i>data.size() - 1) {
			return;
		}
		data[i] = val;
		set(0, 0, data.size() - 1, i, val);
	}
	void set(int TreeIndex, int l, int r, int index, T e) {
		if (l == r) {
			tree[TreeIndex] = e;
			return;
		}
		int LeftTreeIndex = 2 * TreeIndex + 1;
		int RightTreeIndex = 2 * TreeIndex + 2;
		int mid = l + (r - l) / 2;
		if (index >= mid + 1) {
			set(RightTreeIndex, mid + 1, r, index, e);
		}
		else {
			set(LeftTreeIndex, l, mid, index, e);
		}
		tree[TreeIndex] = tree[LeftTreeIndex] + tree[RightTreeIndex];
	}

	T query(int i, int j) {
		if (i > j || i<0 || j>data.size() - 1) {
			return -1;
		}
		return query(0, 0, data.size() - 1, i, j);
	}
	T query(int TreeIndex, int left, int right, int queryL, int queryR) {
		if (left == queryL&&right == queryR) {
			return tree[TreeIndex];
		}
		int LeftTreeIndex = 2 * TreeIndex + 1;
		int RightTreeIndex = 2 * TreeIndex + 2;
		int mid = left + (right - left) / 2;
		if (queryL >= mid + 1) {
			return query(RightTreeIndex, mid + 1, right, queryL, queryR);
		}
		else if (queryR <= mid) {
			return query(LeftTreeIndex, left, mid, queryL, queryR);
		}
		int lrec = query(LeftTreeIndex, left, mid, queryL, mid);
		int rrec = query(RightTreeIndex, mid + 1, right, mid + 1, queryR);
		return lrec + rrec;
	}
private:
	vector<T> data;
	vector<T> tree;
};
int main(void)
{


	system("pause");
	return 0;
}