Create BJ_2169_로봇조종하기.java

Author: kn9012

250331/BJ_2169_로봇조종하기.java

@@ -0,0 +1,50 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+/**
+ * 백준 2169번 로봇 조종하기
+ * - dp
+ */
+ 
+public class Main {
+	public static void main(String[] args) throws IOException {
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		StringTokenizer st = new StringTokenizer(br.readLine());
+		
+		int N = Integer.parseInt(st.nextToken());
+		int M = Integer.parseInt(st.nextToken());
+		
+		int[][] map = new int[N + 1][M + 1];
+		int[][][] dp = new int[N + 1][M + 1][3];
+		
+		for (int i = 1; i <= N; i++) {
+			st = new StringTokenizer(br.readLine());
+			for (int j = 1; j <= M; j++) {
+				map[i][j] = Integer.parseInt(st.nextToken());
+			}
+		}
+		
+		for (int i = 1; i <= N; i++) {
+			for (int j = 1; j <= M; j++) {
+				dp[i][j][0] = dp[i][j][1] = dp[i][j][2] = -101 * N * M;
+			}
+		}
+		
+		dp[1][1][0] = dp[1][1][1] = dp[1][1][1] = map[1][1];
+		
+		for (int i = 1; i <= N; i++) {
+			for (int j = 1; j <= M; j++) {
+				if (i > 1) dp[i][j][1] = Math.max(dp[i - 1][j][0], Math.max(dp[i - 1][j][1], dp[i - 1][j][2])) + map[i][j];
+				if (j > 1) dp[i][j][0] = Math.max(dp[i][j - 1][0], dp[i][j - 1][1]) + map[i][j];
+			}
+			
+			for (int j = M - 1; j >= 1; j--) {
+				dp[i][j][2] = Math.max(dp[i][j + 1][1], dp[i][j + 1][2]) + map[i][j];
+			}
+		}
+		
+		System.out.println(Math.max(dp[N][M][0], dp[N][M][1]));
+	}
+}