Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/16494
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
N개의 정수로 이루어진 수열이 주어진다. 주어진 수열에서 연속된 1개 이상의 수로 이루어진 부분 수열을 "그룹"이라고 하자. 양의 정수 M이 주어졌을 때 M개의 그룹을 선택해서 그룹에 속한 모든 수의 합의 최댓값을 구하는 프로그램을 작성하라.
🔍 풀이 방법
헷갈리긴 했는데, 결국 dp를 통해서 어디까지 진행했을 때 어느것이 최댓값인지만 파악하면 된다.
⏳ 회고
이제 이런것도 잘 못푼다..