Hy all, :) I am struggling to learn basic dp for a while. Its pretty hard for me to understand rcursion. As we all know recursion is the mother of dynamic programming. So, It would be great if you suggest me some good resources for beginner where you learned firstly dp or suggest some classical dp problem with solution so that I will understand the concept or suggest any other way :) Thanks a lot :)
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
26:14:57
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
26:14:57
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 15:20:05 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
All of the guys are continuously giving down voted. I dont know why. People can think about why I cant googled instead of posting here but I always got something special from this community's member. Still I am hoping someone will help me. Sorry for my poor English. :) Thanks. :)
LooOoooooOLooOooOoOOLoOoOoOoOoooLoOoooOooL. LMAO. ROFL. Why are you getting downvoted? Well. The reason is simple. The question that you are answering can easily be answered by a Google search. And you are pretty damn lazy to search it for yourself.
(0/1 Knapsack Problem Top Down Dynamic Programming) — Recursion
https://www.youtube.com/watch?v=149WSzQ4E1g
0/1 Knapsack Problem Dynamic Programming — Bottom Up/Table
https://www.youtube.com/watch?v=8LusJS5-AGo
Some of the typical dp problems to start with are the maximum subarray sum problem, the longest common subsequence problem and the problem where you have a grid with numbers and you want to from the top left corner to the bottom right corner with min or max cost where you are only allowed to travel right or down. Regarding recursion I found it simpler to learn bottom up dp first and learn dp with recursion and memoisation later.