Acwing_796（子矩阵的和）

原题链接：

796. 子矩阵的和 - AcWing题库

题解：

套板子即可

参考模板：

常用代码模板1——基础算法 - AcWing

补充（求S[i][j]的公式）:

代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int a[N][N], s[N][N];

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 >> a[i][j];

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


	while (q--) {
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		cout << s[x2][y2] - s[x1 - 1][y2] - s[x2][y1 - 1] + s[x1 - 1][y1 - 1] << endl;
	}

}