Card game

#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

constexpr int MOD = 1'000'000'007;  



void task1(){
    int n;
    cin >> n;
    vector<int> count(n+1,0);
    
    count[0] = 1;
    for(int i = 1; i <= n; i++){
        
        for(int j = 1; j <= 6; j++){
            if(i >= j) count[i] += count[i-j];
            count[i] %= MOD;
        }
    }

    cout << count[n] << endl;
}

void task2(){
    int n;
    cin >> n;
    vector<int> cards(n+1,0);
    
    for(int i = 1; i <= n; i++){
        cin >> cards[i];
    }

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

    cout << count[n] << endl;
}

int main() {
    
    task2();
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

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