Conversation
Contributor
Author
|
문제가 같이 올라갔네요 ㅜ 디스크는 다시 올릴게요 |
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
1 participant
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/2660
🧭 풀이 시간
30분 - 플루이드 와샬인거 알고 풀긴함
👀 체감 난이도
✏️ 문제 설명
제일 인싸(가까운 친구 많음) 들을 회장 후보로 찾는 나쁜 프로그램
🔍 풀이 방법
플루이드 와샬 기본 개념을 응용(무방향 무가중치)
와샬 배열 완성되면 각 라인별로 MAX 값을 구하고, 그중 가장 작은 라인들이 후보임
⏳ 회고
플루이드 와샬인거 보고 공부하고 풀긴했는데, 직접 풀었고 1트만에 맞춰서 기분이 좋음