BOJ)2156 포도주 시식

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

9465스티커 문제와 유사한 접근

	[1]	[2]	[3]	[4]	[5]	[6]
안마심	0	6	6+10
첫번째잔	6	10	6+13
두번째잔	0	6 +10	10+13

#include <iostream>
#include <algorithm>
using namespace std;
 
int content[10001];
int dp[10001][3];
 
int max(int a, int b, int c) {
    return max(max(a, b), c);
}
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> content[i];
    }
    dp[0][0] = dp[0][1] = dp[0][2] = 0;
 
    for (int i = 1; i <= n; i++) {
        dp[i][0] = max(dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]);
        dp[i][1] = dp[i - 1][0] + content[i];
        dp[i][2] = dp[i - 1][1] + (dp[i-1][1] ? content[i] : 0);
    }
    
    cout << max(dp[n][0], dp[n][1], dp[n][2]);
 
}