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.
↵
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.
