BEAKJOON JAVA ALGORITHM #2156(포도주 시식)

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

import java.util.Scanner; public class a2156 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num+1]; for(int i=1; i<=num; i++) { arr[i] = sc.nextInt(); } int[] d = new int[num+1]; d[1] = arr[1]; if(num >= 2) { d[2] = arr[1] + arr[2]; } for(int i=3; i<=num; i++) {//0번연속, 1번연속, 2번연속일때 d[i] = Math.max(d[i-1], Math.max(d[i-2]+arr[i], d[i-3]+arr[i]+arr[i-1])); } System.out.println(d[num]); } }