实验7-2-3 求矩阵的局部极大值

#include 

int main(){
    int m,n;
    scanf("%d %d",&m,&n);
    int a[m+1][n+1];//编号从1开始
    for(int i=1;ia[i-1][j] && a[i][j]>a[i+1][j] 
               && a[i][j]>a[i][j-1] && a[i][j]>a[i][j+1]){
                printf("%d %d %d\n",a[i][j],i,j);
                you=1;
               }
        }
    }
    if(you==0){
        printf("None %d %d",m,n);
    }
     return 0;
}