二维前缀和模板

 改良后模板

#include<iostream>
using namespace std;
int sum[1001][1001] = { 0 };
int main() {
	ios::sync_with_stdio(false);//快读
	int m, n, x1, y1, x2, y2, value;
	scanf("%d %d", &n, &m);//从一开始避免了分类讨论
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> value; 
			sum[i][j] = sum[i][j - 1] + sum[i - 1][j] - sum[i - 1][j - 1] + value;
		}
	}
	/*for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cout<<sum[i][j]<<" ";
		}
		cout<<endl;
	}*/
	int q;
	cin >> q;
	while (q--) {
		cin >> x1 >> x2 >> y1 >> y2;
		cout << sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1] << endl;
	}

	return 0;
}

改良前模板

#include<iostream>
using namespace std;
int a[1001][1001] = { 0 };
int sum[1001][1001] = { 0 };
void prearrary(int n,int m) {
	sum[0][0] = a[0][0];
	for (int i = 1; i < n; i++) {
		sum[i][0] = sum[i-1][0] + a[i][0];
	}
	for (int i = 1; i < m; i++) {
		sum[0][i] = sum[0][i - 1] + a[0][i];
   }
	for (int i = 1; i < n; i++) {
		for (int j = 1; j < m; j++) {
			sum[i][j] = a[i][j] + sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
		}
	}
}
int sum1(int x1, int y1, int x2, int y2) {
	if (x1 && y1) return sum[x2][y2];
	if (x1 == 0)  return sum[x2][y2] - sum[x2][y1 - 1];
	if (y1 == 0)  return sum[x2][y2] - sum[x1 - 1][y2];
	return sum[x2][y2] - sum[x2][y1 - 1] - sum[x1][y2 - 1] + sum[x1 - 1][y1 - 1];


}
int main() {
	int m, n,x1,y1,x2,y2;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			scanf("%d", &a[i][j]);
		}
	}
	prearrary(n, m);
	int time;
	scanf("%d", &time);
	
	for (int i = 0; i < time; i++) {
		scanf("%d %d %d %d", &x1, &x2, &y1, &y2);
		printf("%d",sum1(x1-1, y1-1, x2-1, y2-1));
		if (i != time - 1) {
			printf("\n");
	  }
	
	}
	
	return 0;
}

 不难看出我们的编译器在进行预处理阶段开辟的数组内存大小不同，用的空间复杂度不同。

其实我们会发现改良后模板相当于将矩阵周围加上边界即一圈0围绕，这样可以避免出现的特殊情况，

前缀和其实就是压缩时间复杂度使得O(n)变成O（n）的预处理，O（1）的计算，在如果进行多实例的测试中可以大大减少我们的运行时间。