using System.Diagnostics; using System.Numerics; class Program { static void Main(string[] args) { string[] inputs = Console.ReadLine().Split(' '); int n = int.Parse(inputs[0]); int m = int.Parse(inputs[1]); int[,] table = InputTable(n, m); int max = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int searchNum = SearchingTotalMax(table, new Vector2(-1, -1), j, i, 3); if (max < searchNum) max = searchNum; } } Console.WriteLine(max); } static int[,] InputTable(int n, int m) { int[,] table = new int[n, m]; for (int i = 0; i < n; i++) { string[] inputs = Console.ReadLine().Split(' '); for (int j = 0; j < m; j++) { table[i, j] = int.Parse(inputs[j]); } } return table; } static int SearchLargeTetromino(int[,] table, int x, int y) { // 4방향 탐색 // 가장 높은 숫자 선택 // 이동 // 이동된 좌표 + 본래 좌표 각각에서 4방향 선택 // 4스택 쌓일 때까지 반복 HashSet selects = new HashSet() { new Vector2(x, y) }; int total = table[y, x]; while (selects.Count < 4) { int max = -1; Vector2 maxPos = Vector2.Zero; foreach (Vector2 pos in selects) { int posX = (int)pos.X; int posY = (int)pos.Y; if (selects.Contains(new Vector2(posX - 1, posY)) == false) { int left = GetValue(table, posX - 1, posY); if (max < left) { max = left; maxPos = new Vector2(posX - 1, posY); } } if (selects.Contains(new Vector2(posX + 1, posY)) == false) { int right = GetValue(table, posX + 1, posY); if (max < right) { max = right; maxPos = new Vector2(posX + 1, posY); } } if (selects.Contains(new Vector2(posX, posY + 1)) == false) { int up = GetValue(table, posX, posY + 1); if (max < up) { max = up; maxPos = new Vector2(posX, posY + 1); } } if (selects.Contains(new Vector2(posX, posY - 1)) == false) { int down = GetValue(table, posX, posY - 1); if (max < down) { max = down; maxPos = new Vector2(posX, posY - 1); } } } selects.Add(maxPos); total += max; } return total; } static int SearchingTotalMax(int[,] table, Vector2 visit, int x, int y, int count) { if ((0 > x || x >= table.GetLength(1)) || (0 > y || y >= table.GetLength(0))) return -1; if (count <= 0) return table[y, x]; int max = -1; List max2Pos = new List(); // Search Left Move if (visit != new Vector2(x - 1, y)) { int result = SearchingTotalMax(table, new Vector2(x, y), x - 1, y, count - 1); if (0 < result && max <= result) { max = result; max2Pos.Add(new Vector2(x - 1, y)); } } // Search Right Move if (visit != new Vector2(x + 1, y)) { int result = SearchingTotalMax(table, new Vector2(x, y), x + 1, y, count - 1); if (0 < result && max <= result) { max = result; max2Pos.Add(new Vector2(x + 1, y)); } } // Search Up Move if (visit != new Vector2(x, y + 1)) { int result = SearchingTotalMax(table, new Vector2(x, y), x, y + 1, count - 1); if (0 < result && max <= result) { max = result; max2Pos.Add(new Vector2(x, y + 1)); } } // Search Down Move if (visit != new Vector2(x, y - 1)) { int result = SearchingTotalMax(table, new Vector2(x, y), x, y - 1, count - 1); if (0 < result && max <= result) { max = result; max2Pos.Add(new Vector2(x, y - 1)); } } // ㅓㅏㅗㅜ 체크 if (count == 2 && max2Pos.Count > 1) { int total = table[(int)(max2Pos[0].Y), (int)(max2Pos[0].X)] + table[(int)(max2Pos[1].Y), (int)(max2Pos[1].X)]; if (max < total) max = total; } return max + table[y, x]; } static int GetValue(int[,] table, int x, int y) { int w = table.GetLength(1); int h = table.GetLength(0); if ((0 <= x && x < w) && (0 <= y && y < h)) return table[y, x]; return -1; } }

제출 #12258

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: