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 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 151 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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 |
---|