Merge pull request #1533 from AlgorithmWithGod/Ukj0ng

[20251128] BOJ / G2 / 가장 긴 증가하는 부분 수열 3

Author: ShinHeeEul

Ukj0ng/202511/28 BOJ G2 가장 긴 증가하는 부분 수열 3.md

@@ -0,0 +1,34 @@
+```
+import java.io.*;
+import java.util.StringTokenizer;
+import java.util.TreeSet;
+
+public class Main {
+    private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    private static TreeSet<Integer> set;
+    private static int n;
+
+    public static void main(String[] args) throws IOException {
+        init();
+        bw.write(String.valueOf(set.size()));
+        bw.flush();
+        bw.close();
+        br.close();
+    }
+
+    private static void init() throws IOException {
+        n = Integer.parseInt(br.readLine());
+
+        set = new TreeSet<>();
+
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            int num = Integer.parseInt(st.nextToken());
+            Integer ceiling = set.ceiling(num);
+            if (ceiling != null) set.remove(ceiling);
+            set.add(num);
+        }
+    }
+}
+```