[Algorithm] BOJ 2156 - 포도주 시식

06 Oct 2020 in Devlog on Algorithm

백준온라인저지 2156번 - 포도주 시식

public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);

        int n = scan.nextInt();

        Integer[] wines = new Integer[n];

        Integer[] Dp = new Integer[n+1];
        for( int i = 0 ; i < n ; i ++ ){
            wines[i] = scan.nextInt();
        }

        Dp[0] = 0;
        for( int i = 1 ; i <= n ; i++){
            if( i == 1 ) { Dp[i] = wines[i-1]; continue; }
            if( i == 2 ) { Dp[i] = wines[i-2] + wines[i-1]; continue; }

            Dp[i] = Dp[i-1] >= Dp[i-2] + wines[i-1] ? Dp[i-1] : Dp[i-2] + wines[i-1];
            Dp[i] = Dp[i] >= Dp[i-3] + wines[i-1] + wines[i-2] ? Dp[i] : Dp[i-3] + wines[i-1] + wines[i-2];
        }

        System.out.println(Dp[n]);



    }