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.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|