#define _CRT_SECURE_NO_WARNINGS #include int n, m, max = -1; int tr[501][501] = { 0 }; int tt(int u, int r, int x, int y, int x1, int y1, int x2, int y2) { if (u == 4) if (max < r) max = r; if (u == 1) { if ((x + 1 != x1 || y != y1) && (x + 1 != x2 || y != y2) && x + 1 < m)//오 tt(2, r + tr[y][x + 1], x, y, x + 1, y1, x2, y2); if ((x - 1 != x1 || y != y1) && (x - 1 != x2 || y != y2) && x - 1 >= 0)//왼 tt(2, r + tr[y][x - 1], x, y, x - 1, y1, x2, y2); if ((y + 1 != y1 || x != x1) && (y + 1 != y2 || x != y2) && y + 1 < n)//아래 tt(2, r + tr[y + 1][x], x, y, x1, y + 1, x2, y2); if ((y - 1 != y1 || x != y1) && (y - 1 != y2 || x != x2) && y - 1 >= 0)//위 tt(2, r + tr[y - 1][x], x, y, x1, y - 1, x2, y2); } else if (u == 2) { if ((x1 + 1 != x || y1 != x) && (x1 + 1 != x2 || y1 != y2) && x1 + 1 < m)//오 tt(3, r + tr[y1][x1 + 1], x, y, x1, y1, x1 + 1, y1); if ((x1 - 1 != x || y1 != y) && (x1 - 1 != x2 || y1 != y2) && x1 - 1 >= 0)//왼 tt(3, r + tr[y1][x1 - 1], x, y, x1, y1, x1 - 1, y1); if ((y1 + 1 != y || x1 != x) && (y1 + 1 != y2 || x1 != x2) && y1 + 1 < n)//아래 tt(3, r + tr[y1 + 1][x1], x, y, x1, y1, x1, y1 + 1); if ((y1 - 1 != y || x1 != x) && (y1 - 1 != y2 || x1 != x2) && y1 - 1 >= 0)//위 tt(3, r + tr[y1 - 1][x1], x, y, x1, y1, x1, y1 - 1); } else if (u == 3) { if ((x2 + 1 != x || y2 != x) && (x2 + 1 != x1 || y2 != y1) && x2 + 1 < m)//오 tt(4, r + tr[y2][x2 + 1], x, y, x1, y1, x2 + 1, y2); if ((x2 - 1 != x || y2 != x) && (x2 - 1 != x1 || y2 != y1) && x2 - 1 >= 0)//왼 tt(4, r + tr[y2][x2 - 1], x, y, x1, y1, x2 - 1, y2); if ((y2 + 1 != y || x2 != x) && (y2 + 1 != y1 || x2 != x1) && y2 + 1 < n)//아래 tt(4, r + tr[y2 + 1][x2], x, y, x1, y1, x2, y2 + 1); if ((y2 - 1 != y || x2 != x) && (y2 - 1 != y1 || x2 != x1) && y2 - 1 >= 0)//위 tt(4, r + tr[y2 - 1][x2], x, y, x1, y1, x2, y2 - 1); } return 0; } int oo(int x, int y) { if (x != 0 && y != 0 && x != m - 1)//위 { if (max < (tr[y][x] + tr[y][x + 1] + tr[y][x - 1] + tr[y - 1][x])) max = (tr[y][x] + tr[y][x + 1] + tr[y][x - 1] + tr[y - 1][x]); } if (x != 0 && x != m - 1 && y != n - 1)//아래 { if (max < (tr[y][x] + tr[y][x + 1] + tr[y][x - 1] + tr[y + 1][x])) max = (tr[y][x] + tr[y][x + 1] + tr[y][x - 1] + tr[y + 1][x]); } if (y != 0 && y != n - 1 && x != m - 1)//오 { if (max < (tr[y][x] + tr[y][x + 1] + tr[y - 1][x] + tr[y + 1][x])) max = (tr[y][x] + tr[y][x + 1] + tr[y - 1][x] + tr[y + 1][x]); } if (y != 0 && x != 0 && y != n - 1)//왼 { if (max < (tr[y][x] + tr[y][x + 1] + tr[y - 1][x] + tr[y + 1][x])) max = (tr[y][x] + tr[y][x + 1] + tr[y - 1][x] + tr[y + 1][x]); } } int main(void) { scanf("%d %d", &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf("%d", &tr[i][j]); } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { tt(1, tr[i][j], j, i, j, i, j, i); oo(j, i); } } printf("%d", max); }

제출 #11917

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: