📖 문제 플로이드 와샬 알고리즘을 직접 만들어보시오 📃 코드 public class Main { static int INF = 1000000; public static void main(String[] args) { int[][] dp = { { 0, 8, 1, INF }, { INF, 0, INF, 1 }, { INF, 2, 0, 9 }, { 4, INF, INF, 0 } }; DP(dp); } private static void DP(int[][] dp) { // result array int result[][] = new int[4][4]; // init for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { result[i][j] = dp[i][..

📖 문제 📃 코드 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Collections; import java.util.PriorityQueue; public class Main { static PriorityQueue heap = new PriorityQueue(Collections.reverseOrder()); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int ..

📖 문제 📃 코드 import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.PriorityQueue; public class Main { static PriorityQueue heap = new PriorityQueue(); public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); for(int i=0;i