I have recently started learning digit dp and was stuck in a problem Longest Increasing Digit Subsequence. After trying for a very long time I was unable to solve it. Help me with the concept and approach to solve the problem.
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
27:36:05
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
27:36:05
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 13:58:56 (j3).
Desktop version, switch to mobile version.
Supported by
I stucked at this problem too. There are some suggestions here. But he didn't mention how the transtions between the DP states work. I have been comtemplating about that for 3 days and still didn't have an idea.
Can anybody help please ?
Thanks for reading <3 <3.