void BuiltTree_On(int n){
				for (int i = 1;i <= n;++i){
					std::cin >> tree[i];
					int j = i + lowbit(i);
					if(j <= n) tree[j] += tree[i];
				}
			}

void BuiltTree_On(int n){
				for (int i = 1;i <= n;++i) std::cin >> base[i];
				for (int i = 1;i <= n;++i){
					tree[i] += base[i];
					int j = i + lowbit(i);
					if(j <= n) tree[j] += tree[i];
				}
				delete[] base;
			}

都是O(n)建树在开O2优化的情况下那个更优啊还是一样