How to solve this problem using DP?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 162 |
| 3 | maomao90 | 161 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | TheScrasse | 153 |
| 10 | maroonrk | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/06/2024 16:10:41 (g1).
Desktop version, switch to mobile version.
Supported by
Calculate $$$dp_i$$$ as max value possible on prefix $$$i$$$. So at $$$i$$$-th position $$$dp_i = \max(dp_{i-2} - a_i - a_{i-1}, dp_{i-1} + a_i)$$$