【CSP 202104-2 csp】邻域均值(DP、二维前缀和)

最新推荐文章于 2022-08-22 12:09:02 发布

都卜冰

最新推荐文章于 2022-08-22 12:09:02 发布

阅读量303

点赞数

分类专栏：刷题记录

本文链接：https://blog.csdn.net/weixin_45209148/article/details/118915843

版权

刷题记录专栏收录该内容

16 篇文章 0 订阅

订阅专栏

在这里插入图片描述

参考链接1: link.
链接2: link.

【注意】未debug答案！！！

//
/*
4 16 1 6
0 1 2 3
4 5 6 7
8 9 10 11
12 13 14 15
*/
#include <iostream>
#include <string>
#include<vector>
using namespace std;

int pic[605][605];
int save[605][605];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, l, r, t;
	cin >> n >> l >> r >> t;

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> pic[i][j];
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			if ((i == 0) && (j == 0))
				save[i][j] = pic[i][j];
			else if (i == 0)
				save[i][j] = pic[i][j] + save[i][j];
			else if (j == 0)
				save[i][j] = pic[i][j] + save[i - 1][j];
			else 	save[i][j] = pic[i][j] + save[i - 1][j] + save[i][j - 1] - save[i - 1][j - 1];
		}
	}
	int up, down, left, right;
	int ans = 0;
	int num;
	int all;

	for (int i = 0; i < n; i++)
	{
		if (i < r)
		{
			up = 0;
		}
		else {
			up = i - r;
		}
		 if (i >= n - r)
			down = n - 1;
		 else 
		down = i + r;
		for (int j = 0; j < n; j++)
		{
			if (j < r)
				left = 0;
			else left = j - r;
			if (j >= n - r)
				right = n - 1;
			else
				right = n + r;
			num = (down - up + 1) * (right - left + 1);

			if ((up == 0) && (left == 0))
				all = save[down][right];
			else if (up == 0)
				all = save[down][right] - save[down][left - 1];
			else if (left == 0)
				all = save[down][right] - save[up - 1][right];
			else all = save[down][right] - save[down][left-1] - save[up - 1][right] + save[up - 1][left-1];

			if (all / num > t * 1.0)
				ans++;



		}
		cout << ans;


	}
  
}