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/24885
🧭 풀이 시간
18분
👀 체감 난이도
✏️ 문제 설명
과거로 돌아가 주식으로 돈을 벌려고 한다. 규칙은 아래와 같다.
주식을 매수할 때는 현재 가지고 있는 돈의 정확히 K배를 대출받아서 살 수 있을만큼 최대한 매수를 해야 하고,
매도할 때는 항상 가지고 있는 모든 주식을 매도해야 한다.
N일 동안의 주가가 주어지면, 최대로 가질 수 있는 돈이 얼마인지 구해보자.
🔍 풀이 방법
[사용한 알고리즘]
직접 시뮬레이션하는 느낌으로 재귀+완탐 써서 해결했다.
⏳ 회고
구현이 좀 까다로웠다