Card game

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+5;

int main () {
    int ar[N];
    int mx[N];
    int n; cin >> n;
    for(int i = 0; i < n; i++) cin >> ar[i];
    
    int best = 0;
    for(int k = 1; k < n-1; k++) {
        mx[k] = 0;
        for(int i = 1; i < k-2; i++) {
            mx[k] = max(mx[k], mx[i]);
        }
        mx[k] += ar[k];
        best = max(best, mx[k]);
    }

    cout << best << '\n';

    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: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED