segTree.cpp

// Segment Tree
// Build: O(n)
// Update: O(log n)
// Query: O(log n)

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

int vet[maxn], tree[4*maxn];

void build(int node, int l, int r){

    if(l==r){
        tree[node]=vet[l];
        return;
    }
    int mid = (l+r)/2;

    build(2*node+1,l,mid);
    build(2*node+2,mid+1,r);

    tree[node] = tree[2*node+1] + tree[2*node+2];
}

void update(int node, int tl, int tr, int idx, int v){

    if(tl==tr){
        tree[node]=v;
        return;
    }
    int mid = (tl+tr)/2;

    if(tl<=idx and idx<=mid) update(2*node+1,tl,mid,idx,v);
    else update(2*node+2,mid+1,tr,idx,v);

    tree[node] = tree[2*node+1] + tree[2*node+2];
}

int query(int node, int tl, int tr, int l, int r){

    if(r<tl or l>tr) return 0;

    if(l<=tl and r>=tr) return tree[node];

    int mid = (tl+tr)/2;

    return query(2*node+1, tl, mid, l, r)+query(2*node+2, mid+1, tr, l, r);
}

int main(){
    int n; 
    cin>>n;

    for(int i=0; i<n; i++) cin>>vet[i];

    build(0, 0, n-1);

    int x = 1;
    while(x<n) x*=2;

    for(int i=0; i<2*x-1; i++) cout<<tree[i]<<" "; cout<<"\n";
}