[백준/BOJ] 백준 14953번 : Game Map

https://www.acmicpc.net/problem/14953 14953번: Game Map Your program is to read from standard input. The input starts with a line containing two integers, n and m (1 ≤ n ≤ 100,000, n-1 ≤ m ≤ 300,000), where n is the number of cities on the game map and m is the number of roads. All cities are numbered f www.acmicpc.net 연결된 간선의 개수가 작은 노드부터 자신의 노드보다 연결된 간선의 수가 더 많은 노드로만 탐색하는 dfs를 수행하여, max_pass에, m..

2023.10.25