解题思路:假设矩阵
[i,j] (1) | [i,j+1] (2) |
[i+1,j] (3) | [i+1,j+1] (4) |
使用for循环找出max,a[i][j+1]>a[i][j]&&a[i+1][j]>a[i][j];
i=1,j开始循环
(1,1)<(1,2),即a[i][j+1]>a[i][j]
i=2
(2,1)<(2,2) , a[i][j+1]>a[i][j]&&a[i+1][j]>a[i][j]
注意事项:
参考代码:
#include<stdio.h>
int main(){
int n,i,j,max;
scanf("%d",&n);
int a[100][100];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
scanf("%d",&a[i][j]);
}
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
max=a[i][j];
if(a[i][j+1]>a[i][j]&&a[i+1][j]>a[i][j]){
max=a[i][j+1];
}
}
}
printf("%d ",max);
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(max==a[i][j]){
printf("%d %d\n",i,j);
}
}
}
}
0.0分
0 人评分