二维前缀和

$s(i,j)$ 的含义是：${\sum }_{i,j=1}^{i_n,j_n}s[i][j]$

---

考虑以下两个问题

$s(i,j)$ 如何计算

$S[i][j]=S[i-1][j]+S[i][j-1]-S[i-1][j-1]+a[i][j]$

注意到，深蓝色的地方被加了两次，所以多加的要被减掉

$(x_1,y_1)$，$(x_2,y_2)$ 这一子矩阵中所有数的和应该如何计算

$\sum ((x_1,y_1)\to (x_2,y_2))=S[x_2][y_2]-S[x_1-1][y_2]-S[x_2][y_1-1]+S[x_1-1][y_1-1]$

注意：黑色的位置被减掉了两次，所以要把多减的地方加上。

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define debug(a) cout << #a << " " << a << endl
const int maxn = 1500;
const int N = 1e6 + 7, M = N * 2;
const int inf = 0x3f3f3f3f;
const long long mod = 1e9 + 7;

inline ll read() {
	char ch = getchar();
	ll p = 1, data = 0;
	while(ch < '0' || ch > '9') {
		if(ch == '-')p = -1;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		data = data * 10 + (ch ^ 48);
		ch = getchar();
	}
	return p * data;
}

int n, m, q;
int a[maxn][maxn];
int sum[maxn][maxn];

int main() {

//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

//	ios::sync_with_stdio(false);
	n = read(), m = read(), q = read();
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= m; j++) {
			a[i][j] = read();
		}
	}

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

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

	int x1, x2, y1, y2;
	while(q--) {
		x1 = read(), y1 = read(), x2 = read(), y2 = read();
		int ans;
		ans = sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
		printf("%d\n", ans);
	}

	return 0;
}