Breaking News: Grepper is joining You.com. Read the official announcement!

range sum queries

Sumit Rawal answered on October 18, 2022 Popularity 8/10 Helpfulness 2/10

answer range sum queries

range sum queries

Comment

// User function Template for Java

class Sol
{
// arr : given array
// n : size of arr
// index : need to update
// new_val : given value to which we need to update index
// st : constructed segment-tree


//Function to update a value in input array and segment tree.
static void updateValue(int arr[], long st[], int n, int index, int val) 
{
   // Your code here
   int diff=val-arr[index];
   arr[index]=val;
       int ss=0;
       int se=n-1;
       int si=0;
       upd(st,ss,se,si,diff,index);

}
private static void upd(long[] st, int ss, int se, int si, int diff,int i) {
       if (i>se ||i<ss){
           return;
       }
       st[si]=st[si]+diff;
       if (ss<se){
           int mid=(ss+se)/2;
           upd(st,ss,mid,2*si+1,diff,i);
           upd(st,mid+1,se,2*si+2,diff,i);
       }

   }


//Function to return sum of elements in range from index qs (query start)
//to qe (query end).
public static long getSum(long st[], int n, int l, int r) 
{
   // Your code here
   int ss=0;
       int se=n-1;
       int si=0;
       return sum12(st,l,r,ss,se,si);

}
private static long sum12(long[] st, int l, int r, int ss, int se, int si) {
       if (se<l || ss>r){
           return 0;
       }
       if (l<=ss && r>=se){
           return st[si];
       }
       int mid=(ss+se)/2;
       return sum12(st,l,r,ss,mid,2*si+1)+sum12(st,l,r,mid+1,se,2*si+2);
   }

}

Popularity 8/10 Helpfulness 2/10 Language sql

Source: Grepper

Tags: range sql sum

Link to this answer
Share Copy Link

Contributed on Oct 18 2022

Sumit Rawal

0 Answers Avg Quality 2/10

range sum queries

Contents

More Related Answers

range sum queries

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.