|
给定M行N列的整数矩阵A,如果A的非边界元素A[j]大于相邻的上下左右4个元素,那么就称元素A[j]是矩阵的局部极大值
输入样例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
- #include<stdio.h>
- #define M 20
- #define N 20
- void main()
- {
- int i,j,m,n,a[N][M];
- scanf("%d%d",&n,&m);
- for ( i=0;i<n;i++ )
- for ( j=0;j<m;j++ )
- scanf("%d",&a[j]);
- for ( i=1;i<n-1;i++ )
- for ( j=1;j<m-1;j++ )
- if(a[i][j]>a[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+1,j+1);
- }
复制代码
局部极大值搜索算法见附件:
|
|