Hi!
Is there a data structure that can perform the following queries (in logaritmic time)?:
(a) for (i = 1; i <= n; i++) A[i] += B[i]
(b) given l and r perform for (i = l; i <= r; i++) B[i] = C
(c) given i, return the value of A[i]
Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Data Structure that is able to perform this queries
Hi!
Is there a data structure that can perform the following queries (in logaritmic time)?:
(a) for (i = 1; i <= n; i++) A[i] += B[i]
(b) given l and r perform for (i = l; i <= r; i++) B[i] = C
(c) given i, return the value of A[i]
Thanks!
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | BlueDiamond | 2020-05-13 17:18:10 | 21 | Tiny change: 'ng queries?:\n\n(a) ' -> 'ng queries (in logaritmic time)?:\n\n(a) ' | ||
en1 | BlueDiamond | 2020-05-13 17:15:48 | 290 | Initial revision (published) |
Name |
---|