From e989f161067417537816f9e3d5d05c585962cc62 Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Mon, 8 Dec 2025 21:17:15 +0900
Subject: [PATCH] =?UTF-8?q?[20251208]=20BOJ=20/=20G3=20/=20=EC=9A=95?=
 =?UTF-8?q?=EC=8B=AC=EC=9F=81=EC=9D=B4=20=ED=8C=90=EB=8B=A4=20/=20?=
 =?UTF-8?q?=EC=9D=B4=EA=B0=95=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...1\354\235\264 \355\214\220\353\213\244.md" | 63 +++++++++++++++++++
 1 file changed, 63 insertions(+)
 create mode 100644 "lkhyun/202512/08 BOJ G3 \354\232\225\354\213\254\354\237\201\354\235\264 \355\214\220\353\213\244.md"

diff --git "a/lkhyun/202512/08 BOJ G3 \354\232\225\354\213\254\354\237\201\354\235\264 \355\214\220\353\213\244.md" "b/lkhyun/202512/08 BOJ G3 \354\232\225\354\213\254\354\237\201\354\235\264 \355\214\220\353\213\244.md"
new file mode 100644
index 00000000..f6a04376
--- /dev/null
+++ "b/lkhyun/202512/08 BOJ G3 \354\232\225\354\213\254\354\237\201\354\235\264 \355\214\220\353\213\244.md"	
@@ -0,0 +1,63 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringTokenizer st;
+
+    static int N;
+    static int[][] forest;
+    static int[][] dp;
+    
+    // 상하좌우
+    static int[] di = {-1, 1, 0, 0};
+    static int[] dj = {0, 0, -1, 1};
+
+    static int ans = 0;
+
+    public static void main(String[] args) throws Exception {
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+
+        forest = new int[N][N];
+        dp = new int[N][N];
+
+        for (int i = 0; i < N; i++) {
+            st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                forest[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+
+        for (int i = 0; i < N; i++) {
+            for (int j = 0; j < N; j++) {
+                ans = Math.max(ans, DFS(i, j));
+            }
+        }
+        
+        bw.write(ans + "");
+        bw.close();
+    }
+
+    public static int DFS(int i, int j) {
+        if (dp[i][j] != 0) {
+            return dp[i][j];
+        }
+        
+        dp[i][j] = 1;
+        
+        for (int k = 0; k < 4; k++) {
+            int ni = i + di[k];
+            int nj = j + dj[k];
+            
+            if (ni >= 0 && ni < N && nj >= 0 && nj < N && forest[ni][nj] > forest[i][j]) {
+                dp[i][j] = Math.max(dp[i][j], DFS(ni, nj) + 1);
+            }
+        }
+        
+        return dp[i][j];
+    }
+}
+```