G14|GESPA105542.

枚举：

代码如下：

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

int a[1010][1010],sum[1000000];

int main()
{
    int n,m,h,k=1;
    cin >> n >> m >> h;
    for(int i = 1;i<=n;i++)
        for(int j = 1;j<=m;j++)
            cin >> a[i][j];
    for(int i = 2;i<=n-1;i++){
        for(int j = 2;j<=m-1;j++)
            {
                bool b = max(a[i][j-1],max(a[i][j+1],max(a[i+1][j-1],max(
                a[i+1][j+1],max(a[i-1][j-1],max(a[i-1][j+1],max(a[i+1][j],max(
                a[i-1][j],a[i][j]))))))))-min(a[i][j],min(a[i][j+1],min(
                a[i][j-1],min(a[i+1][j],min(a[i+1][j+1],min(a[i+1][j-1],
                min(a[i-1][j],min(a[i-1][j+1],a[i-1][j-1]))))))))<=h;
                if(b)
                {
                    sum[k] = a[i][j]+a[i][j+1]+a[i][j-1]+a[i+1][j]+a[i+1][j+1]
                    +a[i+1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i-1][j-1];
                    k++;
                }
            }
    }
    sort(sum****um+k);
    cout << sum[k-1];
    return 0;
}