日志14

鞍点

#include<iostream>

using namespace std;

int main() {

int n, m, arr[100][100];

cin >> n >> m;

for (int i = 0; i < n; i++) {

for (int j = 0; j < m; j++) {

cin >> arr[i][j];

}

}

int max[100],min[100], jrr[100],irr[100];bool found = false;

for (int i = 0; i < n; i++) {

max[i] = arr[i][0];

for (int j = 1; j < m; j++) {

if (max[i] < arr[i][j]) {

max[i] = arr[i][j];

jrr[i] = j;

}

}

}

for(int j=0;j<m;j++){

min[j]=arr[0][j];

for(int i=0;i<n;i++){

if(min[j]>arr[i][j]){

min[j]=arr[i][j];

irr[j]=i;

}

}

}

for (int i = 0; i < n; i++) {

for (int j = 0; j < m; j++) {

if(max[i]==arr[i][j]&&min[j]==arr[i][j]){

found=true;

cout<<i+1<<" "<<j+1<<" "<<arr[i][j]<<endl;

}

}

}

if(!found){

cout<<"No"<<endl;

}

return 0;

}