[20251213] BOJ / G2 / 반도체 설계 / 권혁준 - #1664
Merged
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.
🧷 문제 링크
https://www.acmicpc.net/problem/2352
🧭 풀이 시간
5분
👀 체감 난이도
✏️ 문제 설명
양 쪽에 각각 N개의 포트들이 위에서 아래로 나열되어 있다.
한 쪽의 포트가 다른 쪽의 어떤 포트와 연결되어야 하는지 주어진다.
연결선이 꼬이지 않도록 연결할 수 있는 최대 횟수를 구해보자.
🔍 풀이 방법
LIS
⏳ 회고
교육적임