[BOJ] 백준 4883 삼각 그래프

[문제]

https://www.acmicpc.net/problem/4883

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
    public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st;
    	int tc = 1;
    	while(true) {
    		int n = Integer.parseInt(br.readLine());
        	if(n==0) break;
    		int[][] graph = new int[n+1][3];
        	for(int i=1;i<=n;i++) {
        		st = new StringTokenizer(br.readLine());
        		for(int j=0;j<3;j++) {
        			graph[i][j] = Integer.parseInt(st.nextToken());
        		}
        	}
        	int[][] dp = new int[n+1][3];
        	dp[1][0] = 1000000;
        	dp[1][1] = graph[1][1];
        	dp[1][2] = graph[1][1] + graph[1][2];
        	for(int i=2;i<=n;i++) {  
        		dp[i][0] = Math.min(dp[i-1][0], dp[i-1][1]) + graph[i][0];
        		dp[i][1] = Math.min(Math.min(dp[i-1][0], dp[i][0]), Math.min(dp[i-1][1], dp[i-1][2])) + graph[i][1];
        		dp[i][2] = Math.min(dp[i-1][1], Math.min(dp[i][1], dp[i-1][2])) + graph[i][2];
        	}
        	System.out.println(tc++ + ". " + dp[n][1]);
    	}
    }
}