数组

二维数组

求矩阵中的最大值：
输入行和列，再逐一输入矩阵中的每一个元素。求矩阵中的最大值，如果有多个相同的值。只打印行和列最小的值

#include <iostream>
#include <cmath>
using namespace std;

int a[101][101];
int main() {
    int m, n;
    while (cin >> m >> n) {
        int max = -1, r, c;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                cin >> a[i][j];
            }
        }
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                int x = abs(a[i][j]);
                if (x > max) {
                    max = x;
                    r = i;
                    c = j;
                }
            }
        }
        cout << "Maximal element is " << a[r][c] << " at (" << r << "," << c << ")" << endl;
    }
}