Skip to content

[BOJ] 1912번 #20

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
DoDoron wants to merge 2 commits into
base: master
Choose a base branch
from
Open

[BOJ] 1912번 #20

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e6fb581
lhj 27
Jul 28, 2024
641ceb4
[BOJ] 1912번
Jul 28, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Empty file removed DAILY/24/07/27/Ihj.py
View file
Open in desktop
Empty file.
23 changes: 23 additions & 0 deletions DAILY/24/07/27/lhj.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
import sys
input = sys.stdin.readline

n=int(input())
num = list(map(int, input().split()))

# # trial 1 => 시간 오류
# result=-1000 # -1000 이상
# for i in range(n):
# sum=0
# for j in range(i,n):
# sum+=num[j]
# result = max(result, sum)
# print(result)

# trial 2
# dp
dp=[0]*n # 해당 idx까지 최대 합 저장
dp[0]=num[0]

for i in range(1,n):
dp[i] = max(dp[i-1]+num[i], num[i])
print(max(dp))