C++ 寻找矩阵局部极大值

#include <iostream>
using namespace std;

int main() {
    int M, N;
    cin >> M >> N;
    int A[20][20];
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N; j++) {
            cin >> A[i][j];
        }
    }
    bool found = false;
    for (int i = 1; i < M - 1; i++) {
        for (int j = 1; j < N - 1; j++) {
            if (A[i][j] > A[i - 1][j] && A[i][j] > A[i + 1][j] && A[i][j] > A[i][j - 1] && A[i][j] > A[i][j + 1]) {
                cout << A[i][j] << ' ' << i + 1 << ' ' << j + 1 << endl;
                found = true;
            }
        }
    }
    if (!found) {
        cout << "None " << M << ' ' << N << endl;
    }
    return 0;
}