agrawal117's blog

By agrawal117, history, 4 years ago, In English

How to solve this problem.

Given an array of N integers and we have to perform two type of queries ?

1: L,R,K --> find sum of values in range L to R which are less than K ?

2: A,M --> update value at positon Ath index to M i.e arr[A]=M;

N,Q <=1e5.

Full text and comments »

  • Vote: I like it
  • +19
  • Vote: I do not like it