循环遍历数组

最新推荐文章于 2024-06-04 22:50:27 发布

清河洛.

最新推荐文章于 2024-06-04 22:50:27 发布

阅读量355

点赞数 5

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/2303_80552613/article/details/135289125

版权

#include <stdio.h>
int main(){
    int m,n;
    int a[21][21]={0};
    scanf("%d %d",&m,&n);
    for (int i = 0; i < m;i++) {
        for (int j = 0; j < n;j++) {
            scanf("%d",&a[i][j]);
        }
    }
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n;j++) {
            if(i==0){
                if(j==0){
                    if((a[i][j]>a[i+1][0])&&(a[i][j]>a[i][j+1])){
                        printf("%d %d\n",i,j);
                    }
                } else if(j==n-1){
                    if((a[i][j]>a[i+1][j])&&(a[i][j]>a[i][j-1])){
                        printf("%d %d\n",i,j);
                    }
                }else{
                    if((a[i][j]>a[i][j-1])&&(a[i][j]>a[i][j+1])&&(a[i][j]>a[i+1][j])){
                        printf("%d %d\n",i,j);
                    }
                }
            } else if(i==m-1){
                if(j==0){
                    if((a[i][j]>a[i-1][0])&&(a[i][j]>a[i][j+1])){
                        printf("%d %d\n",i,j);
                    }
                } else if(j==n-1){
                    if((a[i][j]>a[i-1][j])&&(a[i][j]>a[i][j-1])){
                        printf("%d %d\n",i,j);
                    }
                }
                else{
                    if((a[i][j]>a[i][j-1])&&(a[i][j]>a[i][j+1])&&(a[i][j]>a[i-1][j])){
                        printf("%d %d\n",i,j);
                    }
                }
            } else{
                if(j==0){
                    if((a[i][j]>a[i-1][j])&&(a[i][j]>a[i+1][j])&&(a[i][j]>a[i][j+1])){
                        printf("%d %d\n",i,j);
                    }
                } else if(j==n-1){
                    if((a[i][j]>a[i-1][j])&&(a[i][j]>a[i+1][j])&&(a[i][j]>a[i][j-1])){
                        printf("%d %d\n",i,j);
                    }
                } else{
                    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\n",i,j);
                    }
                }
            }
        }
    }
    return 0;
}