Merge pull request #574 from AlgorithmWithGod/JHLEE325

[20250730] BOJ / G4 / 가장 긴 증가하는 부분 수열 4 / 이준희

Author: ShinHeeEul

JHLEE325/202507/30 BOJ G4 가장 긴 증가하는 부분 수열 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() + " ");
+        }
+
+    }
+}
+
+```