usaco-guide/content/4_Silver/6_Silver_Psum.md

---
slug: /silver/prefix-sums
title: "Prefix Sums"
author: Eric Wei (incomplete)
order: 6
---

> Given an array of size $N$, answer $Q$ queries of the following form: Find the sum of all elements between indices $i$ and $j$.

<!-- END DESCRIPTION -->

## Standard

 -  [CSES Range Sum Queries I](https://cses.fi/problemset/task/1646)
 -  [USACO Breed Counting](http://www.usaco.org/index.php?page=viewproblem2&cpid=572)

## Tutorials

This technique is also known as *cumulative sum* or *partial sums*.

 - Intro to USACO 11
 - CPH 9.1

## Extensions

### 2D Prefix Sums

Given a 2-dimensional array of size $NxM$, answer $Q$ queries of the following form: Find the sum of all elements within the rectangle of indices $(x1,y1)$ to $(x2,y2)$.

 - [CSES Forest Queries](https://cses.fi/problemset/task/1652)

### Difference Array

**Task:** Given an array of size $N$, do the following operation $Q$ times: add $X$ to the values between $i$ and $j$. Afterwards, print the final array.

**Solution:** Consider the array formed by $a_i-a_{i-1}$. When processing a range addition, only two values in this difference array change! At the end, we can recover the original array using prefix sums. (The math is left as an exercise to the reader.)

 - (find 1d difference array problem) 

### Prefix Minimum, XOR, etc.

Similar to prefix sums, you can also take prefix minimum or maximum; but *you cannot* answer min queries over an arbitrary range with prefix minimum. (This is because minimum doesn't have an inverse operation, like subtraction is to addition.)
On the other hand, XOR is its own inverse operation...

 - (find range min problem. homework?)
 - [CSES Range XOR Queries](https://cses.fi/problemset/task/1650)

### More Complex Applications
Instead of storing just the values themselves, you can also take a prefix sum over $i\cdot a_i$, or $10^i \cdot a_i$, for instance.

 - (find iota ps problem)
 - [AtCoder Multiple of 2019](https://atcoder.jp/contests/abc164/tasks/abc164_d) (You may want to solve the below problem "Subsequences Summing to Seven" before doing this one.)

## Additional Problems

 - [USACO Subsequences Summing to Seven](http://www.usaco.org/index.php?page=viewproblem2&cpid=595)
 - [USACO My Cow Ate My Homework](http://usaco.org/index.php?page=viewproblem2&cpid=762)
 - [USACO Painting the Barn](http://www.usaco.org/index.php?page=viewproblem2&cpid=919)
add frontmatter to all modules 2020-06-04 01:42:57 +00:00			`---`
			`slug: /silver/prefix-sums`
update frontmatter for all modules 2020-06-04 05:39:49 +00:00			`title: "Prefix Sums"`
upd silver psum 2020-06-04 02:16:50 +00:00			`author: Eric Wei (incomplete)`
update frontmatter for all modules 2020-06-04 05:39:49 +00:00			`order: 6`
add frontmatter to all modules 2020-06-04 01:42:57 +00:00			`---`

misc 2020-06-09 01:41:23 +00:00			`> Given an array of size $N$, answer $Q$ queries of the following form: Find the sum of all elements between indices $i$ and $j$.`
+ hashing, add #s 2020-06-03 20:16:33 +00:00
update frontmatter for all modules 2020-06-04 05:39:49 +00:00			`<!-- END DESCRIPTION -->`
upd silver psum 2020-06-04 02:16:50 +00:00
fix some formatting 2020-06-08 18:07:48 +00:00			`## Standard`
upd silver psum 2020-06-04 02:16:50 +00:00
			`- [CSES Range Sum Queries I](https://cses.fi/problemset/task/1646)`
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`- [USACO Breed Counting](http://www.usaco.org/index.php?page=viewproblem2&cpid=572)`
upd silver psum 2020-06-04 02:16:50 +00:00
			`## Tutorials`

fix some formatting 2020-06-08 18:07:48 +00:00			`This technique is also known as cumulative sum or partial sums.`
+ hashing, add #s 2020-06-03 20:16:33 +00:00
fix some formatting 2020-06-08 18:07:48 +00:00			`- Intro to USACO 11`
upd silver psum 2020-06-04 02:16:50 +00:00			`- CPH 9.1`

			`## Extensions`

			`### 2D Prefix Sums`

Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`Given a 2-dimensional array of size $NxM$, answer $Q$ queries of the following form: Find the sum of all elements within the rectangle of indices $(x1,y1)$ to $(x2,y2)$.`
upd silver psum 2020-06-04 02:16:50 +00:00
			`- [CSES Forest Queries](https://cses.fi/problemset/task/1652)`

			`### Difference Array`

fix some formatting 2020-06-08 18:07:48 +00:00			`Task: Given an array of size $N$, do the following operation $Q$ times: add $X$ to the values between $i$ and $j$. Afterwards, print the final array.`

			`Solution: Consider the array formed by $a_i-a_{i-1}$. When processing a range addition, only two values in this difference array change! At the end, we can recover the original array using prefix sums. (The math is left as an exercise to the reader.)`
upd silver psum 2020-06-04 02:16:50 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`- (find 1d difference array problem)`
upd silver psum 2020-06-04 02:16:50 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`### Prefix Minimum, XOR, etc.`
upd silver psum 2020-06-04 02:16:50 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`Similar to prefix sums, you can also take prefix minimum or maximum; but you cannot answer min queries over an arbitrary range with prefix minimum. (This is because minimum doesn't have an inverse operation, like subtraction is to addition.)`
			`On the other hand, XOR is its own inverse operation...`
fix some formatting 2020-06-08 18:07:48 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`- (find range min problem. homework?)`
			`- [CSES Range XOR Queries](https://cses.fi/problemset/task/1650)`

			`### More Complex Applications`
			`Instead of storing just the values themselves, you can also take a prefix sum over $i\cdot a_i$, or $10^i \cdot a_i$, for instance.`
fix some formatting 2020-06-08 18:07:48 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`- (find iota ps problem)`
			`- [AtCoder Multiple of 2019](https://atcoder.jp/contests/abc164/tasks/abc164_d) (You may want to solve the below problem "Subsequences Summing to Seven" before doing this one.)`

			`## Additional Problems`
fix some formatting 2020-06-08 18:07:48 +00:00
Update 6_Silver_Psum.md 2020-06-05 18:30:28 +00:00			`- [USACO Subsequences Summing to Seven](http://www.usaco.org/index.php?page=viewproblem2&cpid=595)`
			`- [USACO My Cow Ate My Homework](http://usaco.org/index.php?page=viewproblem2&cpid=762)`
			`- [USACO Painting the Barn](http://www.usaco.org/index.php?page=viewproblem2&cpid=919)`