【邻域均值 / 2】

题目

---

代码

#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second

typedef pair<int, int> PII;

const int N = 610;
int g[N][N];
int cal(PII point1, PII point2)
{
    int r1 = point1.x, c1 = point1.y;
    int r2 = point2.x, c2 = point2.y;
    
    return g[r2][c2] - g[r2][c1-1] - g[r1-1][c2] + g[r1-1][c1-1];
}
int main()
{
    int n, l, r, t;
    cin >> n >> l >> r >> t;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int x;
            cin >> x;
            g[i][j] = g[i-1][j] + g[i][j-1] - g[i-1][j-1] + x;
        }
    }

    int cnt = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            int r1 = max(1, i-r);
            int c1 = max(1, j-r);
            int r2 = min(n, i+r);
            int c2 = min(n, j+r);
            
            int sum = cal({r1, c1}, {r2, c2});
            int num = (r2-r1+1) * (c2-c1+1);
            if(sum <= t * num) cnt++;
        }
    }
    
    cout << cnt;
    return 0;
}