[TimeComplexity] baekjoon-12015

Author: Seogeurim

README.md

@@ -306,6 +306,7 @@
 | 06  |     | [Codility-Lesson3 FrogJmp](./src/TimeComplexity/FrogJmp)                 |                           |
 | 07  |     | [Codility-Lesson3 PermMissingElem](./src/TimeComplexity/PermMissingElem) |                           |
 | 08  |     | [Codility-Lesson3 TapeEquilibrium](./src/TimeComplexity/TapeEquilibrium) |                           |
+| 09  |     | [Baekjoon-12015 가장 긴 증가하는 부분 수열 2](./src/TimeComplexity/P12015)     | LIS                       |
 
 ## Series
 

src/TimeComplexity/P12015/Main.java

@@ -0,0 +1,42 @@
+package TimeComplexity.P12015;
+
+import java.io.*;
+import java.util.StringTokenizer;
+
+public class Main {
+
+    static int N, L_idx;
+    static int[] A, L;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/TimeComplexity/P12015/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        N = Integer.parseInt(br.readLine());
+        A = new int[N];
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < N; i++) A[i] = Integer.parseInt(st.nextToken());
+
+        L = new int[N];
+        L[0] = A[0];
+        for (int i = 1; i < N; i++) {
+            if (L[L_idx] < A[i]) L[++L_idx] = A[i];
+            else L[getLowerBound(A[i])] = A[i];
+        }
+
+        System.out.println(L_idx + 1);
+    }
+
+    static int getLowerBound(int k) {
+        int low = 0, high = L_idx;
+        while (low < high) {
+            int mid = (low + high) / 2;
+            if (L[mid] < k) {
+                low = mid + 1;
+            } else {
+                high = mid;
+            }
+        }
+        return low;
+    }
+}

src/TimeComplexity/P12015/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-12015] 가장 긴 증가하는 부분 수열 2
+
+![image](https://user-images.githubusercontent.com/22045163/107511185-7f76aa00-6be8-11eb-899e-c537dad90a69.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107511204-869db800-6be8-11eb-8d16-7fba4ec44ff5.png)

src/TimeComplexity/P12015/input.txt

@@ -0,0 +1,8 @@
+6
+10 20 10 30 20 50
+
+6
+10 5 10 20 30 50
+
+10
+1 100 2 50 60 3 5 6 7 8