code4sk/c/sourcecode/朱森森带领的奇妙冒险/2022-2023第二学期单开班第3次月考/7-1 求矩阵的局部极大值.cpp

/*
7-1 ?????????
?? 10
?? ???
?? ????
??M?N??????A,??A??????A[i][j]?????????4???,??????A[i][j]??????????????????????????????????

????:
???????????A???M???N(3=M,N=20);??M?,????A????N???????????????

????:
????“??? ?? ??”????????????,????????1?????????????;??????1??????,???????????????????,???“None ??? ???”?

????1:
4 5
1 1 1 1 1
1 3 9 3 1
1 5 3 5 1
1 1 1 1 1
????1:
9 2 3
5 3 2
5 3 4
????2:
3 5
1 1 1 1 1
9 3 9 9 1
1 5 3 5 1
????2:
None 3 5
*/

#include<stdio.h>
int main(){
	int m,n;
	scanf("%d %d",&m,&n);
	int a[100][100];
	for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            scanf("%d",&A[i][j]);
        }
    }
    for(i=2;i<m;i++)
    {
        for(j=2;j<n;j++)
        {
            if(A[i][j]>A[i+1][j]&&A[i][j]>A[i][j+1]&&A[i][j]>A[i-1][j]&&A[i][j]>A[i][j-1])
            {
                cnt++;
                printf("%d %d %d\n",A[i][j],i,j);
            }
        }
    }
    if(cnt==0)
        printf("None %d %d",m,n);
	return 0;
}