diff --git "a/\355\225\234\354\244\200\352\267\234/\355\225\234\354\244\200\352\267\234_\353\254\270\354\240\2347.py" "b/\355\225\234\354\244\200\352\267\234/\355\225\234\354\244\200\352\267\234_\353\254\270\354\240\2347.py"
new file mode 100644
index 0000000..bf311c9
--- /dev/null
+++ "b/\355\225\234\354\244\200\352\267\234/\355\225\234\354\244\200\352\267\234_\353\254\270\354\240\2347.py"
@@ -0,0 +1,61 @@
+n, m = map(int, input().split())
+board = [list(map(int, input().split())) for i in range(n)]
+
+dp_up = [[-1e9]*m for i in range(n)]
+dp_down = [[-1e9]*m for i in range(n)]
+dp_up[n-1][0] = board[n-1][0]
+dp_down[n-1][m-1] = board[n-1][m-1]
+
+for i in range(n-1, -1, -1):
+    for j in range(m):
+        if i==n-1 and j==0 : continue
+        if i<n-1 : dp_up[i][j] = max(dp_up[i][j], dp_up[i+1][j])
+        if j>0 : dp_up[i][j] = max(dp_up[i][j], dp_up[i][j-1])
+        dp_up[i][j]+=board[i][j]
+
+for i in range(n-1, -1, -1):
+    for j in range(m-1, -1, -1):
+        if i==n-1 and j==m-1 : continue
+        if i<n-1 : dp_down[i][j] = max(dp_down[i][j], dp_down[i+1][j])
+        if j<m-1 : dp_down[i][j] = max(dp_down[i][j], dp_down[i][j+1])
+        dp_down[i][j]+=board[i][j]
+
+_max = -1e9
+for i in range(n):
+    for j in range(m):
+        _max = max(_max, dp_up[i][j]+dp_down[i][j])
+print(_max)
+
+
+# 기존 소스코드
+import copy
+n, m = map(int, input().split())
+board_up = [list(map(int, input().split())) for _ in range(n)]
+board_down, answer = copy.deepcopy(board_up), -1e9
+for i in range(n-1, -1, -1):
+    for j in range(m):
+        try: 
+            if j-1 >= 0:
+                if i+1 >= n:
+                    board_up[i][j] += board_up[i][j-1]
+                else:
+                    board_up[i][j] += max(board_up[i+1][j], board_up[i][j-1])
+            elif j-1 < 0:
+                board_up[i][j] += board_up[i+1][j]
+        except : pass
+
+        try: 
+            if m-j + 1 < m:
+                if i+1 >= n:
+                    board_down[i][m-j] += board_down[i][m-j+1]
+                else:
+                    board_down[i][m-j] += max(board_down[i+1][m-j], board_down[i][m-j + 1])
+            elif m-j +1 >= m:
+                board_down[i][m-j] += board_down[i+1][m-j]
+        except: pass
+
+for i in range(n):
+    for j in range(m):
+        answer = max(answer, board_up[i][j] + board_down[i][j])
+
+print(answer)
\ No newline at end of file