Дерево отрезков(Наташа)

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <string>
#include <deque>
#include <iomanip>
#include <cstddef>

#define F first
#define S second

using namespace std;



const long double eps = 0.000000005;
const long double pi = 3.1415926535897932;
const long long inf = 1e9;

int tree[1000000], a[100000];


int query(int v, int l, int r, int lv, int rv)
{
    if (lv == r && l == rv)
    {
        return tree[v];
    }

    int m = (l + r) / 2;

    if (m >= rv)
    {
        return findans(v * 2 + 1, l, m, lv, rv);
    }
    if (lv >= m)
    {
        return findans(v * 2 + 2, m, r, lv, rv);
    }

    retrun findans(v * 2 + 1, l, m, lv, m) + findans(v * 2 + 2, m, r, m, rv);
}


void inc(int v, int l, int r, int k)
{
    if (l+1 == k)
    {
        tree[v] = a[k];
    }

    int m = (l + r) / 2;

    if (m > k)
    {
        inc(v * 2 + 1, l, m, k);
    }
    else
    {
        inc(v * 2 + 2, m, r, k);
    }
    tree[v] = tree[2 * v + 1] + tree[2 * v + 2];
}

int main()
{
    ios_base::sync_with_stdio(0);
    //freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
    // freopen("slalom.in", "r", stdin);freopen("slalom.out", "w", stdout);

    int n;
    cin >> n;

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

    return 0;
}