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.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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.
Название |
---|