1 条题解

  • 1
    @ 2026-7-26 10:35:14
    #include<bits/stdc++.h>
    using namespace std;
    int main(){
        int n,m;
        cin>>n>>m;
        int a[n+10][m+10];
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                cin>>a[i][j];
            }
        }
        for (int i = 0; i <= n + 1; i++) {
            a[i][0] = 1e9;
            a[i][m + 1] = 1e9;
        }
        for (int j = 0; j <= m + 1; j++) {
            a[0][j] = 1e9;
            a[n + 1][j] = 1e9;
        }
        int cnt=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(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][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])cnt++;
            }
        }
        cout<<cnt<<endl;
        return 0;
    }
    
    • 1

    信息

    ID
    10063
    时间
    1000ms
    内存
    256MiB
    难度
    9
    标签
    递交数
    18
    已通过
    4
    上传者