Can somebody please explain how dynamic binary index trees work and give me an implementation, I would appreciate your help!
I meet some dificult in coding it !
Sorry about my pour English !
Thanks in advance! :)
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 4039 |
| 2 | tourist | 3841 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3590 |
| 5 | ecnerwala | 3542 |
| 6 | Benq | 3535 |
| 7 | orzdevinwang | 3526 |
| 8 | gamegame | 3477 |
| 9 | heuristica | 3357 |
| 10 | Radewoosh | 3355 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 160 |
| 3 | Um_nik | 160 |
| 5 | djm03178 | 158 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 153 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
I_love_Jiang | 2016-11-11 11:50:29 | 17 | Tiny change: 'w dynamic segment trees wor' -> 'w dynamic binary index trees wor' | |
| en2 |
|
I_love_Jiang | 2016-11-11 10:58:52 | 6 | ||
| en1 |
|
I_love_Jiang | 2016-11-11 10:58:38 | 237 | Initial revision (published) |
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/22/2025 18:49:08 (l1).
Desktop version, switch to mobile version.
Supported by
