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,K --> update value at positon ath index to K i.e arr[A]=K;
N,Q <=1e5.
How to find sum of values in range which are less than 'K' ?
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,K --> update value at positon ath index to K i.e arr[A]=K;
N,Q <=1e5.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en4 | agrawal117 | 2020-07-14 00:34:58 | 0 | (published) | ||
en3 | agrawal117 | 2020-07-14 00:30:01 | 4 | Tiny change: 't positon ath index to K i.e arr[A' -> 't positon Ath index to M i.e arr[A' (saved to drafts) | ||
en2 | agrawal117 | 2020-07-14 00:27:21 | 4 | |||
en1 | agrawal117 | 2020-07-14 00:12:01 | 355 | Initial revision (published) |