Function sum

CSES_Problems/Range-Sum Query 1/Range-Sum Query.cpp:18–24

Function to answer queries in logN time,what we are doing here is we are traversing the whole tree and we are going to it's their child then if current range in tree is exist inside the range [l,r],then we will add that value

} 
//Function to answer queries in logN time,what we are doing here is we are traversing the whole tree and we are going to it's their child then if current range in tree is exist inside the range [l,r],then we will add that value
ll sum(ll v,ll tl,ll tr,ll l,ll r,ll dp[])
{
    if(l>r)return 0;
    if(tl==l&&tr==r)return dp[v];
    ll tm=(tl+tr)/2;
    return sum(v*2,tl,tm,l,min(r,tm),dp)+sum(v*2+1,tm+1,tr,max(l,tm+1),r,dp);
} 
int main()
{   
     ll n,q; cin>>n>>q; ll a[n+10],i,dp[4*n+10],tl,tr,v;