void build(int root,int start,int end){
    if(start == end){
        tree[root] = num[start];
        return;
    }
    int leftroot = root * 2;//左結(jié)點(diǎn)
    int rightroot = root * 2 + 1;//右結(jié)點(diǎn)
    int mid = (start+end)/2;
    build(leftroot,start,mid);//遞歸計(jì)算左結(jié)點(diǎn)
    build(rightroot,mid+1,end);//遞歸計(jì)算右結(jié)點(diǎn)
    tree[root] = tree[leftroot] + tree[rightroot];//根結(jié)點(diǎn)值=左根+右根
}

int query(int root,int start,int end,int l,int r){
    if(l<=start && r>= end){
        return tree[root];
    }
    int leftroot = root * 2;
    int rightroot = root * 2 + 1;
    int mid = (start+end)/2;
    int sum = 0;
    if(l<=mid){
        sum += query(leftroot,start,mid,l,r);
    }
    if(r>mid){
        sum += query(rightroot,mid+1,end,l,r);
    }
    return sum;
}

/**
* 修改[l,r]區(qū)間里的數(shù)，都加上k值
* @param root
* @param start
* @param end
* @param l
* @param r
* @param k
*/
void update(int root,int start,int end,int l,int r,int k){
    if(start == end){
        tree[root] += k;
        return;
    }
    int leftroot = root * 2;
    int rightroot = root * 2 + 1;
    int mid = (start+end)/2;
    if(l<=mid){
        update(leftroot,start,mid,l,r,k);
    }
    if(r>mid){
        update(rightroot,mid+1,end,l,r,k);
    }
    tree[root] = tree[leftroot] + tree[rightroot];
}