C++实现矩阵中马鞍数位置查找

```cpp #include <iostream> using namespace std; const int MAXN = 100; int matrix[MAXN][MAXN]; int main() { int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> matrix[i][j]; } } bool found = false; for (int i = 0; i < n; i++) { int rowMax = matrix[i][0]; int maxCol = 0; for (int j = 1; j < m; j++) { if (matrix[i][j] > rowMax) { rowMax = matrix[i][j]; maxCol = j; } } bool isMinInCol = true; for (int k = 0; k < n; k++) { if (matrix[k][maxCol] < rowMax) { isMinInCol = false; break; } } if (isMinInCol) { cout << i + 1 << " " << maxCol + 1 << endl; found = true; } } if (!found) { cout << "No answer" << endl; } return 0; } ``` ######[AI问答 | 348点数解答 | 2026-02-26 11:56:56]