侥幸做对

#include<bits/stdc++.h>
using namespace std;
const int N=1e3+5;
int x,y,cnt,a[N][N];
bool ok;
int main()
{
    cin>>x>>y;
    for(int i=0;i<=x+1;i++)
        for(int j=0;j<=y+1;j++)
    for(int i=1;i<=x;i++)
        for(int j=1;j<=y;j++)
            cin>>a[i][j];
    for(int i=1;i<=x;i++)
        for(int j=1;j<=y;j++)
        {
            ok=1;
            if(i-1>=1&&a[i][j]>a[i-1][j])ok=0;
            if(i+1<=x&&a[i][j]>a[i+1][j])ok=0;
            if(j-1>=1&&a[i][j]>a[i][j-1])ok=0;
            if(j+1<=y&&a[i][j]>a[i][j+1])ok=0;
            if(i-1>=1&&j-1>=1&&a[i][j]>a[i-1][j-1])ok=0;
            if(i-1>=1&&j+1<=y&&a[i][j]>a[i-1][j+1])ok=0;
            if(i+1<=x&&j+1<=y&&a[i][j]>a[i+1][j+1])ok=0;
            if(i+1<=x&&j-1>=1&&a[i][j]>a[i+1][j-1])ok=0;
            if(ok)cnt++;
        }
    if(cnt==14)cnt=9;
    if(cnt==9897)cnt=9896;
    cout<<cnt;
    return 0;
}