Submission details
Task:Card game
Sender:jonnymorgan
Submission time:2025-09-16 17:42:33 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.58 sdetails
#60.40 sdetails
#70.42 sdetails
#80.48 sdetails
#90.48 sdetails
#100.48 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#140.51 sdetails
#150.48 sdetails

Code

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

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

    if (n < 3) {
        cout << 0 << endl;
        return 0;
    }

    vector<vector<long long>> dp(n, vector<long long>(n, 0));

    for (int length = 3; length <= n; length++) {
        for (int i = 0; i <= n - length; i++) {
            int j = i + length - 1;

            for (int k = i + 1; k < j; k++) {
                long long score = cards[k];

                if (k >= i + 2) {
                    score += dp[i][k-2];
                }

                if (k + 2 <= j) {
                    score += dp[k+2][j];
                }

                dp[i][j] = max(dp[i][j], score);
            }
        }
    }

    cout << dp[0][n-1] << endl;
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
5
9 4 1 6 6

correct output
6

user output
6

Test 2

Verdict: ACCEPTED

input
6
5 6 2 4 10 1

correct output
16

user output
16

Test 3

Verdict: ACCEPTED

input
10
8 9 10 2 7 1 10 10 1 4

correct output
26

user output
26

Test 4

Verdict: ACCEPTED

input
100
1 8 8 5 7 10 9 4 8 10 6 3 8 7 ...

correct output
243

user output
243

Test 5

Verdict: ACCEPTED

input
1000
10 7 5 6 5 2 5 3 2 2 1 6 8 7 8...

correct output
2230

user output
2230

Test 6

Verdict:

input
10000
9 1 8 2 6 5 1 3 3 10 6 3 9 3 1...

correct output
22363

user output
(empty)

Test 7

Verdict:

input
100000
5 5 4 6 8 7 9 6 3 2 5 8 7 3 5 ...

correct output
226636

user output
(empty)

Test 8

Verdict:

input
1000000
5 8 5 7 9 1 9 10 3 6 1 8 3 9 7...

correct output
2259395

user output
(empty)

Test 9

Verdict:

input
1000000
4 5 3 5 4 3 6 7 10 6 3 9 7 9 1...

correct output
2260761

user output
(empty)

Test 10

Verdict:

input
1000000
10 3 6 7 7 10 4 4 5 2 9 4 6 10...

correct output
2260407

user output
(empty)

Test 11

Verdict: ACCEPTED

input
3
87 3 123

correct output
3

user output
3

Test 12

Verdict: ACCEPTED

input
2
175 95

correct output
0

user output
0

Test 13

Verdict: ACCEPTED

input
1
42

correct output
0

user output
0

Test 14

Verdict:

input
1000000
1000 1000 1000 1000 1000 1000 ...

correct output
333333000

user output
(empty)

Test 15

Verdict:

input
1000000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
333333

user output
(empty)