[20251118] BOJ / G4 / 서울에서 경산까지 / 설진영#1446
Merged
ShinHeeEul merged 1 commit intomainfrom Nov 18, 2025
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/14863
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
N개의 구간을 도보 또는 자전거로 이동하여 서울에서 경산까지 가기
🔍 풀이 방법
배낭 문제 변형
DP[시간] = 해당 시간으로 얻을 수 있는 최대 모금액으로 정의
각 구간마다 도보/자전거 선택을 반영하여 테이블 갱신
⏳ 회고
DP 배낭문제군