More on Prefix Sums

Max Subarray Sum

Solution - Max Subarray Sum

Consider the prefix sum array $p$. The subarray sum $a_i \dots a_{j-1}$, where $i < j$ is $p[j]-p[i]$. Thus, we are looking for the maximum possible value of $p[j]-p[i]$ over $0 \leq i < j \leq N$.

For a fixed right bound $j$, the maximum subarray sum is

Thus, we can keep a running minimum to store $\min\limits_{i < j}{p[i]}$ as we iterate through $j$. This yields the maximum subarray sum for each possible right bound, and the maximum over all these values is our answer.

Implementation

Time Complexity: $\mathcal{O}(N)$

Copy
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;
using ll = long long;

int main() {
	int n;
	cin >> n;

Copy
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class MaxSubSum {
	public static void main(String[] args) throws IOException {
		BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
		read.readLine();
		int[] arr = Arrays.stream(read.readLine().split(" ")

Copy
size = int(input())
arr = [int(i) for i in input().split()]
assert len(arr) == size

max_subarray_sum = arr[0]
min_pref_sum = 0
running_pref_sum = 0
for i in arr:
	running_pref_sum += i
	max_subarray_sum = max(max_subarray_sum, running_pref_sum - min_pref_sum)
	min_pref_sum = min(min_pref_sum, running_pref_sum)
print(max_subarray_sum)

2D Prefix Sums

Now, what if we wanted to process $Q$ queries for the sum over a subrectangle of a 2D matrix with $N$ rows and $M$ columns? Let's assume both rows and columns are 1-indexed, and we use the following matrix as an example:

Naively, each sum query would then take $\mathcal{O}(NM)$ time, for a total of $\mathcal{O}(QNM)$. This is too slow.

Let's take the following example region, which we want to sum:

Manually summing all the cells, we have a submatrix sum of $7+11+9+6+1+3 = 37$.

The first logical optimization would be to do one-dimensional prefix sums of each row. Then, we'd have the following row-prefix sum matrix. The desired subarray sum of each row in our desired region is simply the green cell minus the red cell in that respective row. We do this for each row to get $(28-1) + (14-4) = 37$.

Now, if we wanted to find a submatrix sum, we could break up the submatrix into a subarray for each row, and then add their sums, which would be calculated using the prefix sums method described earlier. Since the matrix has $N$ rows, the time complexity of this is $\mathcal{O}(QN)$. This might be fast enough for $Q=10^5$ and $N=10^3$, but we can do better.

In fact, we can do two-dimensional prefix sums. In our two dimensional prefix sum array, we have

This can be calculated as follows for row index $1 \leq i \leq n$ and column index $1 \leq j \leq m$:

Let's calculate $\texttt{prefix}[2][3]$. Try playing with the interactive widget below by clicking the buttons to see which numbers are added in each step. Notice how we overcount a subrectangle, and how we fix this by subtracting $\texttt{prefix}[i-1][j-1]$.

The submatrix sum between rows $a$ and $A$ and columns $b$ and $B$, can thus be expressed as follows:

Summing the blue region from above using the 2D prefix sums method, we add the value of the green square, subtract the values of the red squares, and then add the value of the gray square. In this example, we have

as expected.

Try playing with the interactive widget below by clicking the buttons to see which numbers are added in each step.

Since no matter the size of the submatrix we are summing, we only need to access four values of the 2D prefix sum array, this runs in $\mathcal{O}(1)$ per query after an $\mathcal{O}(NM)$ preprocessing.

Solution - Forest Queries

Copy
#include <iostream>
#include <vector>

using namespace std;

constexpr int MAX_SIDE = 1000;
int tree_pref[MAX_SIDE + 1][MAX_SIDE + 1];
int forest[MAX_SIDE + 1][MAX_SIDE + 1];

int main() {

Copy
import java.io.*;
import java.util.StringTokenizer;

public class ForestQueries {
	static int N;
	static int Q;
	static int[][] pfx;
	static int[][] arr;
	public static void main(String[] args) {
		Kattio io = new Kattio();

Copy
side_len, query_num = [int(i) for i in input().split()]
tree_prefixes = [[0 for _ in range(side_len + 1)] for _ in range(side_len + 1)]
for r in range(side_len):
	for ci, c in enumerate(input()):
		tree = c == "*"
		tree_prefixes[r + 1][ci + 1] += (
			tree_prefixes[r][ci + 1]
			+ tree_prefixes[r + 1][ci]
			- tree_prefixes[r][ci]
			+ tree

Problems

Difference Arrays

Explanation - Greg and Array

Let's create an array $s$, where $s[i]$ is the number of times operation $i$ is applied. The important step is how we update it.

For an interval $[l, r]$, we can't loop through the interval and increment each value, as that would be $\mathcal{O}(MK)$ and too slow. Instead, we increment $s[l]$ by one and decrement $s[r+1]$ by one.

Now, we get the actual array by computing its prefix sum array, resulting in $\mathcal{O}(M)$ time complexity. The second part, applying the operations, can be done exactly the same way.

Implementation - Greg and Array

Time Complexity: $\mathcal{O}(N+M)$

Copy
#include <array>
#include <iostream>
#include <vector>

using namespace std;

int main() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> a(n + 1);

Copy
n, m, k = map(int, input().split())
arr = list(map(int, input().split()))

updates = []
for _ in range(m):
	updates.append(list(map(int, input().split())))

s = [0] * (m + 2)
add = [0] * (n + 2)

Problems

Quiz