Problemadvanced
Partial sums problem
Also called dynamic prefix sums, dynamic range sum with point updates.
Maintain an array under point updates and answer prefix-sum queries; Fenwick and segment trees solve it in O(log n).
Maintain an array under point updates and answer prefix-sum queries; Fenwick and segment trees solve it in O(log n).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Y8HCE3 Edit this page History Report an error