2156 포도주 시식

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int main() {
    int n;
    scanf("%d", &n);
 
    int drink[10005] = { 0 };
    int dp[10005] = { 0 };
 
    for (int i = 1; i <= n; i++) {
        scanf("%d", &drink[i]);
    }
 
    dp[1] = drink[1];
    dp[2] = drink[1] + drink[2];
 
    for (int i = 3; i <= n; i++)
        dp[i] = max(dp[i - 1], max(dp[i - 2] + drink[i], dp[i - 3] + drink[i - 1] + drink[i]));
 
    printf("%d", dp[n]);
}