https://k4i.top/zh/tags/bit/Recent content in BIT on k4i's blogHugo -- gohugo.iozhsky_io@outlook.com (K4i)sky_io@outlook.com (K4i)All content is subject to the license of <a rel="license noopener" href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank">CC BY-NC-SA 4.0</a> .Wed, 20 Jan 2021 14:42:38 +0800https://k4i.top/zh/posts/binary-indexed-tree-or-fenwick-tree/Wed, 20 Jan 2021 14:42:38 +0800sky_io@outlook.com (K4i)Wed, 20 Jan 2021 14:42:38 +0800https://k4i.top/zh/posts/binary-indexed-tree-or-fenwick-tree/<p>树状数组能在 \(O(\log n)\) 时间内查询数组的前缀<strong>和</strong>、更新单个元素，只需要 \(O(n)\) 空间。关键是：每个节点保存一段多长的区间，查询和更新时又该跳到哪个节点？</p> <blockquote> <p><a href="https://github.com/sky-bro/AC/tree/master/Algorithms/BIT">源代码</a></p> </blockquote>K4iBITFenwickTreeData Structure & Algorithm