가장먼노드

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 import java.util.*; class Solution { static boolean[][] map; static int cnt = 0; static int[] dist; static void BFS(int n, int start){ Queue q = new LinkedList(); q.add(start); dist[1] = 0; int max = Integer.MIN_VALUE; while(!q.isEmpty()){ int x = q.poll(); for(i..