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/9465
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
2행 N열로 구성된 스티커 배열이 주어진다.
인접한 스티커(상하좌우)는 동시에 뗄 수 없다.
각 스티커에는 점수가 있으며, 뗀 스티커의 점수를 합산한다.
최대 점수의 합을 구하라.
🔍 풀이 방법
dp[0][i] = max(dp[1][i - 1], dp[1][i - 2]) + sticker[0][i]
dp[1][i] = max(dp[0][i - 1], dp[0][i - 2]) + sticker[1][i]
점화식 사용
⏳ 회고
전형적인 DP 문제, 점화식만 잘 세우면 된다.