#include <iostream>
//#include <algorithm>
using namespace std;
int main()
{
int a[5][5],i,j;
int max = a[i][1];
int min = a[1][j];
for(i=1;i<5;i++){
for(j=1;j<5;j++){
cin>>a[i][j];
}
}
for(i=1;i<5;i++){
int max = a[i][1];
for(j=2;j<5;j++){
if(a[i][j] > max)
max = a[i][j];
}
a[i][0] = max;
}
for(j=1;j<5;j++){
min = a[1][j];
for(i=2;i<5;i++){
if(a[i][j] < min)
min = a[i][j];
}
a[0][j] = min;
}
bool flag = false;
for(i=1;i<5;i++){
for(j=1;j<5;j++){
if(a[i][j] == a[0][j] and a[i][j] == a[i][0]){
cout<<a[i][j]<<" "<<i<<" "<<j<<endl;
flag = true;
}
}
}
if (flag == false)
cout<<"no saddle"<<endl;
return 0;
}
c/c++基础 第五章 案例八 求一个矩阵中的鞍点
于 2024-02-28 14:25:05 首次发布