[20251019] BOJ / G5 / 전깃줄 / 강신지 #1163
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/2565
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
두 전봇대 사이 전깃줄 여러개. 교차하는 전깃줄이 없도록 하려면 최소 몇 개의 전깃줄을 없애야 하는가?
🔍 풀이 방법
교차하지 않게 최대한 많은 전깃줄을 배치한 다음 그 수를 전체 전깃줄의 수에서 빼면 됨.
왼쪽 전봇대 기준으로 오름차순 정렬한 뒤, 오른쪽 전봇대 번호로 최장 증가 부분 수열(LIS) 길이를 구한다.
⏳ 회고
전형적인 LIS 문제였다.