Hey everyone,
I've recently implemented a Fenwick Tree (probably better known a Binary Indexed Tree or a BIT) supporting range-based and point-based sum queries as well as updates, in C++ 14.
The approach was inspired by Petr's blog here!
The implementation is available on github here under fenwicktree.hpp.
Any comments and suggestions are welcome!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
A Fenwick /Binary Indexed Tree Implementation
Revision en1, by ameya, 2018-06-12 23:37:33
History
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/10/2024 09:45:24 (j1).
Desktop version, switch to mobile version.
Supported by
