[Graph] baekjoon-11404

Author: Seogeurim

Diff for: README.md

@@ -165,6 +165,7 @@
 | 02  |     | [Baekjoon-1707 이분 그래프](./src/Graph/P1707)        |      |
 | 03  |     | [Baekjoon-1753 최단경로](./src/Graph/P1753)        |   Dijkstra   |
 | 04  |     | [Baekjoon-11657 타임머신](./src/Graph/P11657)        |   Bellman-Ford   |
+| 05  |     | [Baekjoon-11404 플로이드](./src/Graph/P11404)        |   Floyd-Warshall   |
 
 ### Union-Find
 

Diff for: src/DP/MinAbsSum/Main.java

@@ -0,0 +1,30 @@
+package DP.MinAbsSum;
+
+import java.util.Arrays;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(sol.solution(new int[]{}));
+        System.out.println(sol.solution(new int[]{1, 5, 2, -2}));
+        System.out.println(sol.solution(new int[]{3, 3, 3, 4, 5})); // 0
+    }
+}
+
+class Solution {
+    public int solution(int[] A) {
+        if (A.length == 0) return 0;
+
+        int[] dp = new int[A.length];
+        dp[0] = Math.min(A[0], (-1) * A[0]);
+        for (int i = 1; i < A.length; i++) {
+            if (Math.abs(dp[i-1] + A[i]) < Math.abs(dp[i-1] - A[i])) {
+                dp[i] = dp[i-1] + A[i];
+            } else {
+                dp[i] = dp[i-1] - A[i];
+            }
+        }
+        System.out.println(Arrays.toString(dp));
+        return Math.abs(dp[A.length - 1]);
+    }
+}

Diff for: src/Graph/P11404/Main.java

@@ -0,0 +1,45 @@
+package Graph.P11404;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int n, m;
+    static int[][] D;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/Graph/P11404/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        n = Integer.parseInt(br.readLine());
+        m = Integer.parseInt(br.readLine());
+
+        D = new int[n+1][n+1];
+        while (m-- > 0) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            int a = Integer.parseInt(st.nextToken());
+            int b = Integer.parseInt(st.nextToken());
+            int c = Integer.parseInt(st.nextToken());
+            if (D[a][b] > 0) D[a][b] = Math.min(D[a][b], c);
+            else D[a][b] = c;
+        }
+
+        for (int k = 1; k <= n; k++) {
+            for (int i = 1; i <= n; i++) {
+                for (int j = 1; j <= n; j++) {
+                    if (i == j || D[i][k] == 0 || D[k][j] == 0) continue;
+                    if (D[i][j] == 0) D[i][j] = D[i][k] + D[k][j];
+                    else D[i][j] = Math.min(D[i][j], D[i][k] + D[k][j]);
+                }
+            }
+        }
+
+        for (int i = 1; i <= n; i++) {
+            for (int j = 1; j <= n; j++) {
+                System.out.print(D[i][j] + " ");
+            }
+            System.out.println();
+        }
+    }
+}

Diff for: src/Graph/P11404/README.md

@@ -0,0 +1,7 @@
+## [baekjoon-11404] 플로이드
+
+![image](https://user-images.githubusercontent.com/22045163/106630419-2b077500-65bf-11eb-9dec-b3b94edb092d.png)
+
+![image](https://user-images.githubusercontent.com/22045163/106630455-335fb000-65bf-11eb-9201-e489d997fef3.png)
+
+플로이드-워셜 알고리즘을 이용하는데, 문제에서 "시작 도시와 도착 도시를 연결하는 노선은 하나가 아닐 수 있다." 라는 조건을 확인하고 이 부분을 고려해야 한다.

Diff for: src/Graph/P11404/input.txt

@@ -0,0 +1,16 @@
+5
+14
+1 2 2
+1 3 3
+1 4 1
+1 5 10
+2 4 2
+3 4 1
+3 5 1
+4 5 3
+3 5 10
+3 1 8
+1 4 2
+5 1 7
+3 4 2
+5 2 4