ccf-csp_202104-2

纯暴力会导致后三个用例超时，需要用前面算出来的结果进行迭代

#include <iostream>
using namespace std;
int **M;
int **zz;
int SUM = 0;
int n, L, r, t;

bool wb(const int &x, const int &y) {
	if (y == 0 || x == 0) {
//	if (1) {

		double sum = 0, num = 0;
		for (int dx = max(x - r, 0); dx <= min(x + r, n - 1); dx++) {
			for (int dy = max(y - r, 0); dy <= min(y + r, n - 1); dy++) {
				sum += M[dx][dy];
				num++;
			}
		}
		zz[x][y] = sum;
		sum = sum / num;
		return sum <= t;
	} else {
		double sum = zz[x - 1][y];

		if (x - r > 0) {
			for (int i = max(y - r, 0); i <= min(y + r, n - 1); i++) {
				sum = sum - M[x - r - 1][i];

			}
		}

		if (x + r < n ) {
			for (int i = max(y - r, 0); i <= min(y + r, n - 1 ); i++) {
				sum = sum + M[x + r][i];

			}
		}
		int num = ((min(y + r, n - 1) - max(y - r, 0)) + 1) * (1 + (min(x + r, n - 1) - max(x - r, 0)));
		zz[x][y] = sum;
		sum = sum / num;
		return sum <= t;

	};

}


int main() {
//	freopen("ccf-csp_202104-2-cin.txt", "r", stdin);
	cin >> n >> L >> r >> t;
	M = (int **)malloc(sizeof(int *) *  (n + 1));
	zz = (int **)malloc(sizeof(int *) * (n + 1));
	for (int i = 0; i <= n; i++) {
		M[i] = (int *)malloc(sizeof(int) * (n + 1));
		zz[i] = (int *)malloc(sizeof(int) * (n + 1));
	}


	for (int x = 0; x < n; x++)
		for (int y = 0; y < n; y++)
			cin >> M[x][y];

	for (int x = 0; x < n; x++) {
		for (int y = 0; y < n; y++) {
			SUM = SUM + wb(x, y);
		}
	}



	free(M);
	cout << SUM << endl;
	return 0;
}