[TimeComplexity] baekjoon-14003

Author: Seogeurim

README.md

@@ -309,6 +309,7 @@
 | 08  |     | [Codility-Lesson3 TapeEquilibrium](./src/TimeComplexity/TapeEquilibrium) |                           |
 | 09  |     | [Baekjoon-12015 가장 긴 증가하는 부분 수열 2](./src/TimeComplexity/P12015)     | LIS                       |
 | 10  |     | [Baekjoon-12738 가장 긴 증가하는 부분 수열 3](./src/TimeComplexity/P12738)     | LIS                       |
+| 11  |     | [Baekjoon-14003 가장 긴 증가하는 부분 수열 5](./src/TimeComplexity/P14003)     | LIS                       |
 
 ## Series
 

src/TimeComplexity/P14003/Main.java

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

src/TimeComplexity/P14003/README.md

@@ -0,0 +1,5 @@
+## [baekjoon-14003] 가장 긴 증가하는 부분 수열 5
+
+![image](https://user-images.githubusercontent.com/22045163/107529400-2ca7ed00-6bfe-11eb-8310-9dd6a7fd19ea.png)
+
+![image](https://user-images.githubusercontent.com/22045163/107529432-35002800-6bfe-11eb-9000-17eb2782782b.png)

src/TimeComplexity/P14003/input.txt

@@ -0,0 +1,6 @@
+6
+10 20 10 30 20 50
+
+8
+3 2 5 2 3 1 4 1
+