[20250816] BOJ / G4 / 줄세우기 / 이준희 #674
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/2631
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
아이들의 번호와 순서가 주어질 때
아이들을 번호순으로 정렬하기 위해 옮겨져야 하는 아이들의 최소 수를 구하는 문제입니다.
🔍 풀이 방법
번호 순으로 오름차순 시켜야되기 때문에
가장 긴 증가하는 부분수열을 구한 후
나머지 애들을 맞는 자리로 끼워 맞추면 되기 때문에 LIS 로 풀었습니다.
⏳ 회고
아이디어 떠올리는게 전부인 문제였습니다.