Techniqueintro
Prefix sums
Also called cumulative sums, running sums, summed-area table (1D).
Precompute P[i] = a[1]+...+a[i] in O(n) so any range sum a[l..r] is P[r]-P[l-1] in O(1).
Precompute P[i] = a[1]+...+a[i] in O(n) so any range sum a[l..r] is P[r]-P[l-1] in O(1).
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 37H2XG Edit this page History Report an error