Merge pull request #80 from AlgoLeadMe/22-SeongHoonC

22-SeongHoonC

SeongHoonC/README.md

@@ -23,4 +23,5 @@
 | 19차시 | 2024.04.04 | 그리디 | <a href="https://www.acmicpc.net/problem/16496">큰 수 만들기</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/72 |
 | 20차시 | 2024.04.07 | DP | <a href="https://www.acmicpc.net/problem/7579">앱</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/75 |
 | 21차시 | 2024.04.11 | DP | <a href="https://www.acmicpc.net/problem/1149">RGB거리</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/77 |
+| 21차시 | 2024.05.01 | DP | <a href="https://www.acmicpc.net/problem/11053">가장 긴 증가하는 부분 수열</a> |https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/80 |
 ---

SeongHoonC/dp/가장 긴 증가하는 부분 수열.kt

@@ -0,0 +1,20 @@
+import java.io.BufferedReader
+import java.io.InputStreamReader
+import kotlin.math.max
+
+fun main() {
+    val br = BufferedReader(InputStreamReader(System.`in`))
+    val n = br.readLine().toInt()
+    val arr = br.readLine().split(" ").map { it.toInt() }
+
+    val answer = Array(n) { 1 }
+
+    for (now in 1 until n) {
+        for (target in 0 until now) {
+            if (arr[target] < arr[now]) {
+                answer[now] = max(answer[now], answer[target] + 1)
+            }
+        }
+    }
+    println(answer.max())
+}