C++实现矩阵最大元素与最后元素交换

```cpp #include <iostream> using namespace std; const int MAXN = 10; int a[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 >> a[i][j]; } } int max_val = a[0][0]; int max_row = 0, max_col = 0; // 找到攻击力最大的武器 for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i][j] > max_val) { max_val = a[i][j]; max_row = i; max_col = j; } } } // 交换最大元素和最后一个元素 int temp = a[n - 1][m - 1]; a[n - 1][m - 1] = a[max_row][max_col]; a[max_row][max_col] = temp; // 输出交换后的矩阵 for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cout << a[i][j]; if (j < m - 1) { cout << " "; } } cout << endl; } return 0; } ``` ######[AI问答 | 396点数解答 | 2026-03-20 23:55:14]