[BOJ] #11053. 가장 긴 증가하는는 부분 수열 / 실버2 / 42분 (성공)

Author: Mingguriguri

minjeong/DynamicProgramming/2024-04-01-[백준]-#11053-가장긴증가하는부분수열.py

@@ -0,0 +1,12 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+A = list(map(int, input().strip().split()))
+dp = [1] * n
+for i in range(n):
+    for j in range(i):
+        if A[i] > A[j]:
+            dp[i] = max(dp[i], dp[j]+1)
+
+print(max(dp))