조립라인

n이 1일 때 처리를 해주어야 정답이 됨..

 

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];
        int[] B = new int[n];
        int[][] dp = new int[2][n];
        int[] atob = new int[n-1];
        int[] btoa = new int[n-1];

        int answer = 0;
        if(n==1) answer = Math.min(sc.nextInt(), sc.nextInt());
        else {
        for(int i=0; i<=n-2; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
            
            atob[i] = sc.nextInt();
            btoa[i] = sc.nextInt();
        }
        dp[0][0] = A[0];
        dp[1][0] = B[0];
        A[n-1] = sc.nextInt();
        B[n-1] = sc.nextInt();

        for(int i=1; i<n; i++) {
            dp[0][i] = Math.min(dp[0][i-1], dp[1][i-1] + btoa[i-1]) + A[i];
            dp[1][i] = Math.min(dp[1][i-1], dp[0][i-1] + atob[i-1]) + B[i];
        }
            }

        if(n==1) System.out.println(answer);
        else System.out.println(Math.min(dp[0][n-1], dp[1][n-1]));

    }
}