[BOJ] 연속합 / 실버 2 / 60분 힌트 사용

https://www.acmicpc.net/problem/1912

Author: YoonYn9915

YoonYn9915/dp/2025-05-03-[백준]-#1912-연속합.py

@@ -0,0 +1,7 @@
+n = int(input())
+arr = list(map(int, input().split()))
+dp = [0] * n
+dp[0] = arr[0]
+for i in range(1, n):
+    dp[i] = max(arr[i], dp[i-1]+arr[i])
+print(max(dp))