mirror of
https://github.com/m1ngsama/code4sk.git
synced 2025-12-25 02:56:17 +00:00
30 lines
456 B
C++
30 lines
456 B
C++
//求矩阵的局部极大值
|
|
#include<stdio.h>
|
|
int main()
|
|
{
|
|
int i, j, m, n, a[20][20];
|
|
int t=-1;
|
|
scanf("%d%d",&m,&n);
|
|
for(i=0;i<m;i++)
|
|
{
|
|
for(j=0;j<n;j++)
|
|
{
|
|
scanf("%d",&a[i][j]);
|
|
}
|
|
}
|
|
for(i=1;i<m-1;i++)
|
|
{
|
|
for(j=1;j<n-1;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])
|
|
{
|
|
printf("%d %d %d",a[i][j],i+1,j+1);
|
|
printf("\n");
|
|
t=1;
|
|
}
|
|
}
|
|
}
|
|
if(t==-1)
|
|
printf("None %d %d\n",m,n);
|
|
return 0;
|
|
}
|