[20251114] BOJ / G4 / 수 묶기 / 이준희 #1402
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
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/1744
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
수열이 주어지고 수는 위치 상관없이 두개씩 묶거나 안묶을 수 있고 묶은 경우에는 곱해서 더하게 되는데 이 때 결과값의 최대를 구하는 문제입니다.
🔍 풀이 방법
양수 끼리는 최대한 큰거끼리 곱하고
1이랑은 곱하지 않고
음수는 0이랑 곱해서 0으로 만들거나 절댓값이 큰거끼리 묶어서 양수로 만들었습니다.
⏳ 회고
분기해야 하는 조건이 꽤 있었습니다