线段树结构的代码，是一种比较高级的数据结构，对区间的增删只需要O(logn)-Segment tree structure of the code, is a relatively high-level data structure, the additions and deletions to the range only need O (logn)