From 6ab85d2925257ed01e29aa3a90c7a8301b3a8688 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Wed, 30 Jul 2025 07:58:45 +0900
Subject: [PATCH] =?UTF-8?q?[20250730]=20BOJ=20/=20G4=20/=20=EA=B0=80?=
 =?UTF-8?q?=EC=9E=A5=20=EA=B8=B4=20=EC=A6=9D=EA=B0=80=ED=95=98=EB=8A=94=20?=
 =?UTF-8?q?=EB=B6=80=EB=B6=84=20=EC=88=98=EC=97=B4=204=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A4=80=ED=9D=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...353\266\204 \354\210\230\354\227\264 4.md" | 55 +++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 "JHLEE325/202507/30 BOJ G4 \352\260\200\354\236\245 \352\270\264 \354\246\235\352\260\200\355\225\230\353\212\224 \353\266\200\353\266\204 \354\210\230\354\227\264 4.md"

diff --git "a/JHLEE325/202507/30 BOJ G4 \352\260\200\354\236\245 \352\270\264 \354\246\235\352\260\200\355\225\230\353\212\224 \353\266\200\353\266\204 \354\210\230\354\227\264 4.md" "b/JHLEE325/202507/30 BOJ G4 \352\260\200\354\236\245 \352\270\264 \354\246\235\352\260\200\355\225\230\353\212\224 \353\266\200\353\266\204 \354\210\230\354\227\264 4.md"
new file mode 100644
index 00000000..6dc753b4
--- /dev/null
+++ "b/JHLEE325/202507/30 BOJ G4 \352\260\200\354\236\245 \352\270\264 \354\246\235\352\260\200\355\225\230\353\212\224 \353\266\200\353\266\204 \354\210\230\354\227\264 4.md"	
@@ -0,0 +1,55 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws Exception {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+
+        int n = Integer.parseInt(br.readLine());
+
+        int[] arr = new int[n];
+        int[] dp = new int[n];
+        int[] prev = new int[n];
+        Arrays.fill(dp, 1);
+        Arrays.fill(prev, -1);
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        for (int i = 0; i < n; i++) {
+            for (int j = 0; j < i; j++) {
+                if (arr[i] > arr[j] && dp[i] < dp[j] + 1) {
+                    dp[i] = dp[j] + 1;
+                    prev[i] = j;
+                }
+            }
+        }
+
+        int max = 0, idx = 0;
+        for (int i = 0; i < n; i++) {
+            if (dp[i] > max) {
+                max = dp[i];
+                idx = i;
+            }
+        }
+
+        Stack<Integer> stack = new Stack<>();
+        while (idx != -1) {
+            stack.push(arr[idx]);
+            idx = prev[idx];
+        }
+
+        System.out.println(max);
+        while (!stack.isEmpty()) {
+            System.out.print(stack.pop() + " ");
+        }
+
+    }
+}
+
+```