81 삐약 : 백준 1149| RGB거리 [바킹독 문제 풀이|DP|JAVA]

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

 

package BKD_0x10_DP;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BOJ_1149 {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine());

        int[][] input = new int[N+1][3];
        int[][] dp = new int[N+1][3];

        int R =0;
        int G = 1;
        int B = 2;

        for(int i=1;i<=N;i++){
            StringTokenizer st = new StringTokenizer(br.readLine());
            input[i][R] = Integer.parseInt(st.nextToken());
            input[i][G] = Integer.parseInt(st.nextToken());
            input[i][B] = Integer.parseInt(st.nextToken());
        }

        for(int i=2;i<=N;i++){
            input[i][R] += Math.min(input[i-1][G],input[i-1][B]);
            input[i][G] += Math.min(input[i-1][R],input[i-1][B]);
            input[i][B] += Math.min(input[i-1][G],input[i-1][R]);
        }

        System.out.println(Math.min(input[N][R],Math.min(input[N][G],input[N][B])));

    }
}

 

 

 

참고 url : https://st-lab.tistory.com/128

[백준] 1149번 : RGB거리 - JAVA[자바]