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.
→ Обратите внимание
Соревнование идет
2023 Post World Finals Online ICPC Challenge powered by Huawei
11 дней
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
11 дней
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 09.05.2024 14:16:37 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
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.