差分与前缀和

前缀和

//比起模板更像一种思路，一种数学公式：s[i] = s[i - 1] + a1;可以通过s[r] - s[l - 1]快速求出(r, l)这段数据之间的数字总和

#include<iostream>

using namespace std;

const int N = 100010;

int n, m;
int s[N], q[N];

int main()
{
	scanf_s("%d%d", &n, &m);

	for (int i = 1; i <= n; i++) scanf_s("%d", &q[i]);
	for (int i = 1; i <= n; i++) s[i] = s[i - 1] + q[i];
	while (m--) {
		int l, r;
		cin >> l >> r;
		cout << s[r] - s[l - 1] << endl;
	}

	return 0;

}

二维前缀和

//靠两个数学公式进行对比
//前缀和：s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + str[i][j];
//求某一范围，详见下：

#include<iostream>

using namespace std;

const int N = 1010;//开太大会超空间

int str[N][N], s[N][N];//str[n][n]为所存入的数字，s[n][n]为其前缀和

int main()
{
	int n, m, k;

	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)//从0开始会导致超出数组范围
		for (int j = 1; j <= m; j++)
			cin >> str[i][j];
	//对s[i][j]进行预处理（前缀和）
	for (int i = 1; i <= n; i++)//从0开始会导致超出数组范围
		for (int j = 1; j <= m; j++)
			s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + str[i][j];
 //求部分和
	while (k--) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		printf("%d\n", s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1]);
	}

	return 0;
}

分差

/*分差与前缀和的关系类似于积分与求导，可相互转换
  分差的作用：1.直接用分差求出其所对应的前缀和（时间复杂度为O(n)） 
			  2.令前缀和a中的[l, r] + c，直接转化为：分差b[l] + c 与 b[r + 1] - c */


#include<iostream>

using namespace std;

const int N = 10086;

int b[N], a[N];

void insert(int l, int r, int x)
{
	b[l] += x; 
	b[r + 1] -= x;
}

int main()
{
	int n, m;

	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) insert(i, i, a[i]);//已知分差求前缀和
	//分差的计算：b1 = a1; b2 = a2 - a1; b3 = a3 - a2;
	//可知，求b[n]，直接在b[n - 1]时，对b[n - 1 + 1]减去a[n - 1]，就可以直接在下一段加上b[n]
	//与插入操作类似，也可以将其想象成a[N]一开始全为0，对[N, N]进行插入c的操作
	
	cout << endl;
	while (m--) {//插入操作：当a[l, r]范围内插入数字c，相当于b[l] + c, b[r + 1] - c;
		int r, l, x;
		cin >> l >> r >> x;
		insert(l, r, x);
	}
	
	for (int i = 1; i <= n; i++) a[i] = a[i - 1] + b[i];//前缀和的计算
	for (int i = 1; i <= n; i++) cout << a[i] << ' ';

	return 0;
}

二维差分

//没有太多想说的吧，感觉二维分差和二维前缀和相似；可以相互转换，与一维没有太大的区别，除了公式

#include<iostream>

using namespace std;

const int N = 1010;

int s[N][N], str[N][N];

void insert(int x1, int y1, int x2, int y2, int x)
{
	s[x1][y1] += x;
	s[x1][y2 + 1] -= x;
	s[x2 + 1][y1] -= x;
	s[x2 + 1][y2 + 1] += x;
}

int main()
{
	int n, m, q;
	
	cin >> n >> m >> q;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> str[i][j];

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			insert(i, j, i, j, str[i][j]);

	while (q--) {
		int x1, y1, x2, y2, x;
		cin >> x1 >> y1 >> x2 >> y2 >> x;
		insert(x1, y1, x2, y2, x);
	}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++)
			cout << s[i][j] << ' ';
		cout << endl;
	}
		
			

	return 0;
}