#include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; if (n == 1 || m == 1) { cout << 1; return 0; } int arr[n][m], max = 1; for (int i = 0; i < n; i++) { string aa; cin >> aa; for (int j = 0; j < aa.length(); j++) { arr[i][j] = aa[j] - '0'; } } for (int i = 0; i < n ; i++) { for (int j = 0; j < m; j++) { int a = arr[i][j]; for (int k = m - 1; k > j; k--) { // cout << k <<" " << j << endl; // cout << j <<" " << k << " " << a <<" " << arr[i][k] << endl; if (a == arr[i][k]) { int cha = k - j; // cout<< i << " " << cha << endl; // cout << j+cha > m-1 << if(i+cha > n || j+cha > m){ continue; } // cout << i <<" " << j << " " << k << endl; // cout <<"I+c: " << i+cha; // cout <<" J+C: " << j+cha << endl; // cout << cha << endl; // cout<< arr[i][k] << " "; // cout << a << " "; // cout << arr[i + cha][j + cha] << " "; // cout << arr[i + cha][j] <<" " << cha << endl; if (a == arr[i + cha][j + cha] && a == arr[i + cha][j]) { // cout <<"A:" << a <<" I:" << i << " J:" << j << " " << cha << " " << max << endl; if (max <= cha) { max = cha + 1; } } } } } } cout << max * max; return 0; }

제출 #117565

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: