[20250617] BOJ / G4 / 트리의 지름 / 설진영 #364
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/1967
🧭 풀이 시간
35분
👀 체감 난이도
✏️ 문제 설명
가중치가 있는 트리에서 트리 지름 구하기
🔍 풀이 방법
임의의 노드에서 가장 먼 노드는 반드시 지름의 끝점 중 하나 라는 원리를 이용해서
dfs 두번 돌려서 최장 거리 찾기
⏳ 회고
처음에는 리프노드 간 최장 거리가 트리의 지름이라 오해했는데, 이는 가중치가 있는 트리에서는 의미가 없다
트리 지름을 구하는 알고리즘을 알고있어야 쉽게 풀 수 있는 문제였는듯