题解（暴力枚举）

我的方法比较简单，遍历搞特判。（动态数组没学）

#include<bits/stdc++.h>
using namespace std;
int a[105][105];
int main(){
    int m,n,cnt=0;cin>>n>>m;
    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(i==1){
            	if(j==1){
            		if(a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i+1][j+1]){
						cnt++;
					}
				}else if(j==m){
					if(a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i+1][j-1]){
						cnt++;
					}
				}else{
					if(a[i][j]<=a[i+1][j]&&a[i][j]<=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+1]){
						cnt++;
					}
				}
			}else if(i==n){
            	if(j==1){
            		if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j+1]){
						cnt++;
					}
				}else if(j==m){
					if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i-1][j-1]){
						cnt++;
					}
				}else{
					if(a[i][j]<=a[i-1][j]&&a[i][j]<=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+1]){
						cnt++;
					}
				}
            }else if(j==1){
            	if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j+1]&&a[i][j]<=a[i-1][j+1]&&a[i][j]<=a[i+1][j+1]){
					cnt++;
				}
            }else if(j==m){
            	if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=a[i][j-1]&&a[i][j]<=a[i-1][j-1]&&a[i][j]<=a[i+1][j-1]){
					cnt++;
				}
            }else{
                if(a[i][j]<=a[i-1][j]&&a[i][j]<=a[i+1][j]&&a[i][j]<=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+1]&&a[i][j]<=a[i+1][j-1]&&a[i][j]<=a[i+1][j+1]){
					cnt++;
            	}
        	}
    	}
	}
	cout<<cnt;
    return 0;
}