How do i solve this Dynamic Programming Problem link
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3856 |
| 2 | jiangly | 3747 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3591 |
| 6 | gamegame | 3477 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3462 |
| 9 | ecnerwala | 3451 |
| 10 | heuristica | 3431 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | -is-this-fft- | 162 |
| 3 | Dominater069 | 160 |
| 4 | Um_nik | 158 |
| 5 | atcoder_official | 157 |
| 6 | Qingyu | 156 |
| 7 | adamant | 151 |
| 7 | djm03178 | 151 |
| 7 | luogu_official | 151 |
| 10 | awoo | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Feb/24/2025 02:43:32 (f1).
Desktop version, switch to mobile version.
Supported by
Let F[i] = best sum you can achieve when it's your turn and there are i elements left..
You can make a simple observation that if player A takes F[N] points then player B will have Total Points — F[n].
Based on that let Sum[i] be the sum of the last i elements in the stack then F[i] can be one of these 3 cases:
F[i] = A[i] + sum[i-1] -F[i-1].
F[i]= A[i] + A[i-1] + sum[i-2] -F[i-2].
F[i]= A[i] + A[i-1] + A[i-2] + sum[i-3] -F[i-3].