[#15] Feat: Add 가장 긴 증가하는 부분 수열 2

Author: letsjo

12015.py

@@ -0,0 +1,29 @@
+# 가장 긴 증가하는 부분 수열 2
+# Binary Search, Stack
+
+N = int(input())
+A = list(map(int, input().split()))
+
+stack = []
+
+
+def binarySearch(arr, start, end, target):
+    if (start >= end):
+        return start
+    mid = (start + end) // 2
+
+    if (arr[mid] == target):
+        return mid
+    if (arr[mid] < target):
+        return binarySearch(arr, mid+1, end, target)
+    return binarySearch(arr, start, mid, target)
+
+
+for a in A:
+    if not stack or (stack[-1] < a):
+        stack.append(a)
+    else:
+        i = binarySearch(stack, 0, len(stack), a)
+        stack[i] = a
+
+print(len(stack))