第三次上机

要求是查找马鞍点，嗯，感觉不是有手就行？

/*
 * @Author: LIXINTAO
 * @Version:
 * @Date: 2021-11-04 14:01:40
 * @LastEditTime: 2021-11-04 14:43:41
 * @LastEditors: LIXINTAO
 * @Description:
 */

void minmax(array *pa)
{
    int i, j;
    int b = 0, c = 0, e = 0, flag = 0;
    for (i = 0; i < m; i++)
    {
        for (j = 0; j < n; j++)
        {
            if (pa->A[i][b] > pa->A[i][j])
            {
                b = j;
            }
            if (pa->A[i][b] == pa->A[i][j])
            {
                flag = -1; //防止出现一排最小值相同的情形
            }
            else
            {
                flag = 0;
            }
        } //找出行最小
        for (j = 0; j < m; j++)
        {
            if (pa->A[i][b] >= pa->A[j][b])
            {
                c++;
            }
        } //找出列最小
        if (c == m && flag == 0)
        {
            printf("%d %d  %d\n", i + 1, b + 1, pa->A[i][b]);
            e++;
        }
        c = 0;
        b = 0;
        flag = 0;
    }
    if (e == 0)
        printf("no\n");
}