寒假训练 第九节 基础算法 总结

一维前缀和

前缀和是为了处理在数组中，进行多次区间总和查询并输出查询结果的基本算法。
维前缀和的公式：sum[i] = sum[i - 1] + a[i]

#include <iostream>

using namespace std;

int get_sum(int* sum, int L, int R) {
	if (L <= 0) return sum[R];
	return sum[R] - sum[L - 1];
}

int main() {
	int n, q;

	cin >> n >> q;

	int* a = new int[n];

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	// 构建前缀和数组
	int* sum = new int [n];

	sum[0] = a[0];
	for (int i = 1; i < n; i++) {
		sum[i] = sum[i - 1] + a[i];
	}

	for (int i = 0; i < n; i++) {
		cout << sum[i] << "   ";
	}

	cout << endl;
	// 查询 L - R 区间和

	while (q--) {
		cout << "\n请输入查询的 L 和 R" << endl;
		int L;
		int R;
		cin >> L >> R;

		cout << get_sum(sum, L, R);
	}

	return 0;
}

一维差分

拆分就是前缀和的相反

#include <iostream>
using namespace std;

void mode(int* d, int L, int R, int e) {
	d[L] += e;
	d[R + 1] -= e;
}

int main() {
	int n, m;

	cin >> n >> m;

	int* a = new int[n+1];

	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	int* d = new int[n+1];
	// 构建差分数列

	// 在差分序列上进行操作

	// 求操作后差分序列的前缀和

	for (int i = 0; i < n; i++) {
		d[i] = 0;
	}


	while (m--) {
		cout << "操作的　L　和　R　以及　数" << endl;
		int L;
		int R;
		int e;

		cin >> L >> R >> e;
		mode(d, L, R, e);
		
	}

	// 构建前缀和数组
	int* sum = new int[n + 1];

	sum[0] = d[0];
	for (int i = 1; i < n; i++) {
		sum[i] = sum[i - 1] + d[i];
	}

	for (int i = 0; i < n; i++) {
		a[i] += sum[i];
		cout << a[i] << " ";
	}
	return 0;
}

二维前缀和

二维前缀和是由一维前缀和推演得到的，在一维前缀和中，我们已经知道了多次查询使用前缀和算法会减少运算次数，从而达到了减少运算时间的目的。

公式： s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];

#include <iostream>
using namespace std;
const int n = 3, m = 4;

int map[n][m] = {
	{1, 5, 6, 8},
	{9, 6, 7, 3},
	{5, 3, 2, 4}
};

int sum[n][m];
// 构建前缀和
void pre_sum() {
	sum[0][0] = map[0][0];

	for (int i = 1; i < n; i++) {
		sum[i][0] = sum[i - 1][0] + map[i][0];
	}
	for (int j = 1; j < m; j++) {
		sum[0][j] = sum[0][j - 1] + map[0][j];
	}
	for (int i = 1; i < n; i++) {
		for (int j = 1; j < m; j++) {
			sum[i][j] = map[i][j] + sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];
		}
	}

	return;
}

int get_sum(int x1, int y1, int x2, int y2) {
	if (!x1 && !y1) return sum[x2][y2];
	if (!x1) return sum[x2][y2] - sum[x2][y1 - 1];
	if (!y2) return sum[x2][y2] - sum[x1 -1][y2];
	return sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1];
}


int main() 
	pre_sum();
	cout << get_sum(1, 1, 2, 2) << " " << endl;
	cout << get_sum(0, 1, 1 ,3) << " " << endl;

	return 0;
}

二维前缀和就对应着二维拆分

#include<iostream>
using namespace std;
const int n = 3, m = 4;

int map[n][m] = {
	{1, 5, 6, 8},
	{9, 6, 7, 3},
	{5, 3, 2, 4}
};

int sum[n][m];
int d[n + 1][m + 1] = {0};
void mode(int x1, int y1, int x2, int y2,int v) {
	d[x1][y1] += v;
	d[x2 + 1][y1] -= v;
	d[x1][y2 + 1] -= v;
	d[x2 + 1][y2 + 1] += v;
}
void pre_sum() {
	sum[0][0] = d[0][0];

	for (int i = 1; i < n; i++) {
		sum[i][0] = sum[i - 1][0] + d[i][0];
	}
	for (int j = 1; j < m; j++) {
		sum[0][j] = sum[0][j - 1] + d[0][j];
	}
	for (int i = 1; i < n; i++) {
		for (int j = 1; j < m; j++) {
			sum[i][j] = d[i][j] + sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1];
		}
	}
	return;
}
void print() {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << map[i][j] << " ";
		}
		cout << endl;
	}
}
int main() {
	// 差分为 0 
	mode(0, 0, 2, 1, 3);
	mode(1, 1, 2, 2, -1);
	pre_sum();
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			map[i][j] += sum[i][j];
		}
	}
	print();

	return 0;
}