히더

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14Rq5aABUCFAYi #include #include #include using namespace std; int result, N;char arr[100][100]; void cal(int i, int sj, int ej, int l){int zz = 1; int ll = l;if (arr[i][sj] == arr[i][ej]){while (1){if (arr[i][sj + zz] != arr[i][ej - zz]) break; if (ll < 4){result = max(result,l); break;}ll -= 2; zz++;}}int z..