From dd3760c2612050fd9b1b4dcf4acfd6b49dbdee93 Mon Sep 17 00:00:00 2001
From: suyeun84 <81475092+suyeun84@users.noreply.github.com>
Date: Wed, 12 Feb 2025 17:53:03 +0900
Subject: [PATCH] =?UTF-8?q?[20250212]=20BOJ=20/=20G4=20/=20RGB=EA=B1=B0?=
 =?UTF-8?q?=EB=A6=AC=202=20/=20=EA=B9=80=EC=88=98=EC=97=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...2 BOJ G4 RGB\352\261\260\353\246\254 2.md" | 56 +++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 "suyeun84/202502/12 BOJ G4 RGB\352\261\260\353\246\254 2.md"

diff --git "a/suyeun84/202502/12 BOJ G4 RGB\352\261\260\353\246\254 2.md" "b/suyeun84/202502/12 BOJ G4 RGB\352\261\260\353\246\254 2.md"
new file mode 100644
index 00000000..1822c0ad
--- /dev/null
+++ "b/suyeun84/202502/12 BOJ G4 RGB\352\261\260\353\246\254 2.md"	
@@ -0,0 +1,56 @@
+```java
+import java.util.*;
+import java.io.*;
+
+class Solution
+{
+	public static void main(String[] args) throws Exception{
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        
+        int N = Integer.parseInt(st.nextToken());
+        int[][] board = new int[N][3];
+        int[][][] dp = new int[3][N][3];
+        int answer = Integer.MAX_VALUE;
+        
+        for (int i = 0; i < N; i++) {
+        	st = new StringTokenizer(br.readLine());
+        	for (int j = 0; j < 3; j++) {
+        		board[i][j] = Integer.parseInt(st.nextToken());
+        	}
+        }
+        for (int k = 0; k < 3; k++) {
+        	for (int i = 0; i < N; i++) {
+        		Arrays.fill(dp[k][i], 1001);
+        	}
+        	for (int i = 0; i < N-1; i++) {
+            	// 시작이 0일때
+            	if (i == 0) {
+            		dp[k][i][k] = board[0][k];
+            		continue;
+            	}
+            	dp[k][i][0] = Math.min(dp[k][i-1][1], dp[k][i-1][2]) + board[i][0];
+            	dp[k][i][1] = Math.min(dp[k][i-1][0], dp[k][i-1][2]) + board[i][1];
+            	dp[k][i][2] = Math.min(dp[k][i-1][1], dp[k][i-1][0]) + board[i][2];
+            }
+        	if (k == 0) {
+        		dp[k][N-1][1] = Math.min(dp[k][N-2][0], dp[k][N-2][2]) + board[N-1][1];
+        		dp[k][N-1][2] = Math.min(dp[k][N-2][0], dp[k][N-2][1]) + board[N-1][2];
+        		answer = Math.min(Math.min(dp[k][N-1][1], dp[k][N-1][2]), answer);
+        	}
+        	else if (k == 1) {
+        		dp[k][N-1][0] = Math.min(dp[k][N-2][1], dp[k][N-2][2]) + board[N-1][0];
+        		dp[k][N-1][2] = Math.min(dp[k][N-2][0], dp[k][N-2][1]) + board[N-1][2];
+        		answer = Math.min(Math.min(dp[k][N-1][0], dp[k][N-1][2]), answer);
+        	}
+        	else if (k == 2) {
+        		dp[k][N-1][1] = Math.min(dp[k][N-2][0], dp[k][N-2][2]) + board[N-1][1];
+        		dp[k][N-1][0] = Math.min(dp[k][N-2][2], dp[k][N-2][1]) + board[N-1][0];
+        		answer = Math.min(Math.min(dp[k][N-1][1], dp[k][N-1][0]), answer);
+        	}
+        }
+        System.out.println(answer);
+	}
+}
+
+```