[백준] 2156 포도주 시식[자바]

---

https://www.acmicpc.net/board/view/64747

글 읽기 - 와인을 마시지 않는 경우가 왜 필요한가요?

https://st-lab.tistory.com/132

[백준] 2579번 : 계단 오르기 - JAVA [자바]

https://st-lab.tistory.com/135

[백준] 2156번 : 포도주 시식 - JAVA [자바]

https://www.acmicpc.net/board/view/77754

글 읽기 - 포도주 문제, 로직이 잘못된건가요?

---

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

public class Main {
	static int[] wine;
	static Integer[] max = null;
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		wine = new int[N+1];
		max = new Integer[N+1];
		for(int i = 1; i <= N; i++) {
			wine[i] = Integer.parseInt(br.readLine());
		}
		System.out.println(dp(N));
	}
	static int dp(int n) {
		if(n <= 0)
			return 0;
		if(max[n] == null) {
			int a = dp(n-2) + wine[n];
			int b = dp(n-3) + wine[n-1] + wine[n];
			int c = dp(n-1);
			if(b > a)
				a = b;
			if(a >= c)
				max[n] = a;
			else
				max[n] = c;
		}
		return max[n];
	}
}