Card game

#include <iostream>
#include <vector>

using namespace std;

const int m = 1000000007;

int main() {
    int n;
    cin >> n;
    vector<int> cards(n + 1, 0);
    for (int x = 1; x <= n; ++x) cin >> cards[x];

    vector<int> dp (n, 0);
    dp[3] = cards[2];
    for (int i = 3; i <= n; ++i) {
        dp[i] = max(dp[i - 1], dp[i - 3] + cards[i - 1]);
    



    }

    //for (int i = 1; i <= n; ++i) {
    //    cout << dp[i] << ",";
    //}
    //cout << endl;
    cout << dp[n] << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: RUNTIME ERROR

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0)...

Test 3

Verdict: RUNTIME ERROR

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0)...

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED