ДО A OK

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}


int N;

int L,R;

struct tree{
    vector <ll> S;
    void bld(){
        cin>>N;
        int rawN=N;
        int k = log2(N);
        if (pow(2, k) < N){
            k++;
        }
        N = pow(2,k);
        S.assign(2*N-1, 0);
        for (int i = N-1; i < N - 1 + rawN; ++i){
            cin>>S[i];
        }
        for (int i = N-2; i >= 0; --i){
            S[i] = S[2*i+1] + S[2*i+2];
        }
    }
    void sh(){
        int k = log2(N);
        int id=-1;
        for (int i = 0; i <= k;++i){
            for (int j = 0; j < pow(2, i); ++j){
                id++;
                cout<<S[id]<<' ';
            }cout<<"\n";
        }
    }

    ll getS(int l, int r, int id){
        //cout<<"L R = "<<L<<' '<<R<<"\n";
        //cout<<"l r  = "<<l<<' '<<r<<"\n";
        if (l >= L && r <= R){
            //cout<<"A\n";
            return S[id];
        }
        else if (r < L || l > R){
            //cout<<"B\n";
            return 0;
        }
        //cout<<"C\n";
        int m = (l+r)/2;
        ll A = getS(l, m, 2*id+1), B = getS(m+1, r, 2*id+2);
        return A+B;
    }
};

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    tree T;
    T.bld();
    //T.sh();
    int K; cin>>K;
    for (int i=0;i<K;++i){
        cin>>L>>R;
        L--; R--;
        ll r = T.getS(0, N-1, 0);
        cout<<r<<' ';
    }


}
/*
7
1 2 3 4 5 6 7
*/