树状数组解决区间操作_高效 对数组的某个区间进行两种操作：1）求和 2）每个数据加常数。要求：时间复杂度低 -The tree array to solve the interval _ efficient operation Two kinds of operations for a range of array: 1) the sum 2) each data with constant. Requirements: low time complexity.