[20251115] BOJ / P2 / 점프 점프 2 / 권혁준 #1412
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/14249
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
N개의 돌이 일렬로 놓여있다.
i번 돌에서는 왼쪽 혹은 오른쪽으로 a[i]만큼 점프할 수 있다.
S번 돌에서 출발해서 방문할 수 있는 최대 돌의 개수를 구해보자.
🔍 풀이 방법
SCC단위로 그래프를 압축시켜DAG를 만든다.압축된 점의 가중치는 해당
SCC에 속한 점의 개수로 두고, 이 그래프에서위상 정렬+DP로 최대 방문 가능한 점의 수를 구해줬다.⏳ 회고
얼마 전에 푼 ATM 문제랑 비슷함