Skip to content

Commit c02235f

Browse files
committed
[BOJ] 연속합 / 실버 2 / 60분 힌트 사용
https://www.acmicpc.net/problem/1912
1 parent c99671d commit c02235f

File tree

1 file changed

+7
-0
lines changed

1 file changed

+7
-0
lines changed
Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
n = int(input())
2+
arr = list(map(int, input().split()))
3+
dp = [0] * n
4+
dp[0] = arr[0]
5+
for i in range(1, n):
6+
dp[i] = max(arr[i], dp[i-1]+arr[i])
7+
print(max(dp))

0 commit comments

Comments
 (0)