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! :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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! :)
Название |
---|
http://stackoverflow.com/questions/21995930/dynamic-i-e-variable-size-fenwick-tree
do you means that? or what? this is http://codeforces.me/contest/101/submission/18138434 solution of this problem with dynamic segment tree(for example).