习题7-5 找鞍点

#include<stdio.h>

int main(void)
{
    int n;
    int a[6][6];
    int row_max[6];        //每 一行的最大数
    int col_min[6];        //每一列的最大数

    scanf_s("%d", &n);

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            scanf_s("%d", &a[i][j]);
        }
    }

    /*找出每一行的最大值*/
    for (int i = 0; i < n; i++)
    {
        int row_max_index = 0;
        for (int j = 1; j < n; j++)
        {
            if (a[i][row_max_index] < a[i][j])
            {
                row_max_index = j;
            }
        }

        row_max[i] = a[i][row_max_index];
    }

    /*找出每一列的最小值*/
    for (int i = 0; i < n; i++)
    {
        int col_min_index = 0;
        for (int j = 1; j < n; j++)
        {
            if (a[j][i] < a[col_min_index][i])
            {
                col_min_index = j;
            }
        }

        col_min[i] = a[col_min_index][i];
    }

    int count = 0;        //统计鞍点的个数
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            if (a[i][j]==row_max[i]&&a[i][j]==col_min[j])
            {
                printf("%d %d\n", i, j);
                count++;
            }
        }
    }

    if (count == 0)
    {
        printf("NONE\n");
    }

    return 0;
}