From 2f8b6708ee6cd7a36fea52e703e73171c14041a4 Mon Sep 17 00:00:00 2001
From: JHLEE325 <82587652+JHLEE325@users.noreply.github.com>
Date: Sat, 20 Sep 2025 19:45:46 +0900
Subject: [PATCH] =?UTF-8?q?[20250920]=20BOJ=20/=20G2=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=203=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 3.md" | 41 +++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 "JHLEE325/202509/20 BOJ G2 \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 3.md"

diff --git "a/JHLEE325/202509/20 BOJ G2 \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 3.md" "b/JHLEE325/202509/20 BOJ G2 \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 3.md"
new file mode 100644
index 00000000..714a9bda
--- /dev/null
+++ "b/JHLEE325/202509/20 BOJ G2 \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 3.md"	
@@ -0,0 +1,41 @@
+```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];
+
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) {
+            arr[i] = Integer.parseInt(st.nextToken());
+        }
+
+        int[] lis = new int[n];
+        int size = 0;
+
+        for (int num : arr) {
+            int pos = lowerBound(lis, 0, size, num);
+            lis[pos] = num;
+            if (pos == size) size++;
+        }
+
+        System.out.println(size);
+    }
+
+    static int lowerBound(int[] arr, int left, int right, int num) {
+        while (left < right) {
+            int mid = (left + right) / 2;
+            if (arr[mid] < num) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return left;
+    }
+}
+```