7-2-3 求矩阵的局部极大值 (15分)

#include
int main()
{
int a[20][20],m,n,c=0;
scanf("%d %d",&m,&n);
for(int i=0;i for(int j=0;j scanf("%d",&a[i][j]);
}
}
for(int i=1;i for(int j=1;j if(a[i][j]>a[i][j-1]&&a[i][j]>a[i][j+1]&&a[i][j]>a[i-1][j]&&a[i][j]>a[i+1][j])
{
printf("%d %d %d\n",a[i][j],i+1,j+1);
c++;
}
}
}
if(c==0) printf(“None %d %d”,m,n);
return 0;
}