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 K i.e arr[A]=M;
N,Q <=1e5.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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,M --> update value at positon ath index to K i.e arr[A]=M;
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 |
---|