Card game

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

int solve(vector<int> row){
    int n = row.size();
    vector<int> sol(n,0);
    sol[2] = row[1];

    for(int i = 3; i < n; ++i){
        sol[i] = max(sol[i-1],sol[i-3]+row[i-1]);
    }

    return sol[n-1];
}
int main(){
    int n;
    cin >> n;
    vector<int> row(n,-1);

    for(int i = 0; i < n; ++i){
        cin>>row[i];
    }
    cout<<solve(row)<<endl;
}

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