[백준 1051번] 숫자 삼각형

소스코드

---

#include <iostream>
using namespace std;
 
int main() {
    int num[52][52],n, m, r, Max=1;
    cin >> n >> m;
    r = n > m ? m : n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            char a;
            cin >> a;
            num[i][j] = a - '0';
        }
    }
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int a = 1; a < r; a++) {
                if (j + a > m - 1 || i + a > n - 1) continue;
                if (num[i][j] != num[i][j + a] || num[i][j] != num[i + a][j] || num[i][j] != num[i + a][j + a]) continue;
                if (num[i][j] == num[i][j + a] && num[i][j] == num[i + a][j] && num[i][j] == num[i + a][j + a])
                    if (Max < (a + 1)*(a + 1)) Max = (a + 1)*(a + 1);
            }
        }
    }
    cout << Max << '\n';
    return 0;
}