[BOJ] #11055. 가장 큰 증가하는 부분수열 / Level 2 / 50분(실패)

Author: Mingguriguri

minjeong/DynamicProgramming/2024-04-10-[백준]-#11055-가장큰증가하는부분수열.py

@@ -0,0 +1,18 @@
+import sys
+input = sys.stdin.readline
+
+n = int(input())
+nums = list(map(int, input().split()))
+dp = [1] * n
+dp[0] = nums[0]
+
+
+for i in range(len(nums)):
+    for j in range(i):
+        if nums[j] < nums[i]:
+            dp[i] = max(dp[i], dp[j]+nums[i])
+        else:
+            dp[i] = max(dp[i], nums[i])
+
+    print(dp)
+print(max(dp))