own segment tree

/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <iostream>
#include <vector>

using namespace std;

vector<int> tree;

int getSum(int q, int tl, int tr, int l, int r) {
    if(tl >= l && tr <= r)
        return tree[q];
    if(tl >= r || tr <= l)
        return 0;

    int mid = (tl + tr)/2;
    int getl = getSum(q*2, tl, mid, l, r);
    int getr = getSum(q*2+1, mid, tr, l, r);
    cout << "getl: [" << tl << ", " << mid << "]: " << getl << " (" << q*2 << ") tree[q*2]: " << tree[q*2] << '\n';
    cout << "getr: [" << mid << ", " << tr << "]: " << getr << " (" << (q*2+1) << ") tree[q*2+1]: " << tree[q*2+1] << '\n';
    return getl + getr;
}
int main()
{
    int n;
    cin >> n;
        //12:46
    int k = 1;
    while(k < n)
        k *= 2;
    cout << "k is " << k << '\n';
    tree.resize(8*n, 0);

    for(int i = 0; i < n; i++) {
        cin >> tree[k+i];
        int uk1 = k+i;
        while(uk1 != 1) {
            tree[uk1/2] = tree[(uk1/2)*2] + tree[(uk1/2)*2 + 1];
            uk1/=2;
        }
    }
    int kkk;
    cin >> kkk;
    for(int i = 0; i < kkk; i++) {
        char ch;
        int a, b;
        cin >> ch;
        if(ch == '+') {
            cin >> a >> b;
            int uk1 = k+a;
            tree[uk1] += b;
            while(uk1 != 1) {
                tree[uk1/2] = tree[(uk1/2)*2] + tree[(uk1/2)*2+1];
                uk1/=2;
            }
        }

        if(ch == '?') {
            cin >> a >> b;
            cout << "[" << a << ", " << b << "]: ";
            cout << getSum(1, 0, k, a, b) << '\n';
        }


        for(int j = 0; j < n; j++)
            cout << tree[k+j] << ' ';
        cout << '\n';
    }


    cout << "k is " << k << '\n';
    for(int j = 0; j < k+n; j++)
       cout << j << ' ';
    cout << '\n';
    for(int j = 0; j < k+n; j++)
       cout << tree[j] << ' ';
/*
0  1  2  3 4 5 6 7 8 9 10 11 12
35 15 10 5 3 7 5 0 1 2 3  4  5


              15
      10              5
  3       7        5     0
1   2   3   4   5     0    0
*/
    return 0;
}