[20250918] BOJ / G4 / 들판 건너가기 / 권혁준 #918
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/25759
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
아름다움이 A[i]인 N개의 꽃을 차례대로 지나가며 딸지 말지 결정한다.
지나가며 딴 꽃들을 순서대로 놓았을 때 (인접한 꽃의 아름다움 차이)^2의 최댓값을 구해보자.
🔍 풀이 방법
dp[i] = 아름다움이 i인 경우에서의 최댓값으로 정의하면 dp 배열 크기를 101로만 잡아도 된다.각 수를 입력받고, 기존 dp배열의 값을 이용해 신규 dp값을 구해서 O(100N)에 해결했다.
⏳ 회고
그리디로 풀려 했는데 안되길래 포기함