[20260128] BOJ / G2 / 가장 긴 증가하는 부분 수열 3 / 김민진 #1850
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.
🧷 문제 링크
🧭 풀이 시간
25분
👀 체감 난이도
✏️ 문제 설명
주어진 수열의 가장 긴 증가하는 부분 수열의 최대 길이는?
🔍 풀이 방법
이분탐색
lowerbound로 현재 요소와 같거나 요소보다 바로 다음으로 큰 수 찾아서 바꿔끼우기,,
⏳ 회고
저번에 이렇게 한 번 풀어봤어서 빨리 풀었음
음수인 거 인지하고 있었는데 코드 짜다보니 손 가는대로 풀게 돼서 계속 틀림 ㅋㅋ
주어진 수의 최솟값보다 작은 수를 초기 값으로 둬야함
아니면 리스트가 비었는지 매번 확인하거나?