G13|GESPA106100.

模拟

代码如下:

#include<bits/stdc++.h>
using namespace std;

int a[110][110],s;

int main()
{
    int n,m;
    cin >> n >> m;
    for(int i = 0;i<=n+1;i++)
        for(int j = 0;j<=m+1;j++)
            a[i][j] = 100005;
    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++)
        {
            if(a[i][j-1]>=a[i][j]&&a[i][j+1]>=a[i][j]&&
            a[i+1][j-1]>=a[i][j]&&a[i+1][j]>=a[i][j]&&
            a[i+1][j+1]>=a[i][j]&&a[i-1][j-1]>=a[i][j]&&
            a[i-1][j]>=a[i][j]&&a[i-1][j+1]>=a[i][j])s++;
        }
    }
    cout << s;
    return 0;
}