How to become strong and expert in DP ?
can any body tell me some problems and some links to read ?
thanks all!
→ Обратите внимание
До соревнования
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
5 дней
Зарегистрироваться »
Rayan Programming Contest 2024 - Selection (Codeforces Round, Div. 1 + Div. 2)
5 дней
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 25.11.2024 11:08:53 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
DP for Dynapic Programming?
No, It's for Dynamic Programming.
No, It,s for Display Picture ;)
I suggest to you reading this article with practicing examples mentioned in it.
https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
I'd suggest you reading Nicolaus Wirt — "Algorithms and Data Structures". Chapter "Dynamic Programming"
Practice makes perfect.
The core of DP is to turn the problem into a formula, to generate an new algorithm. It is likely that 100 DP problems have 101 formulas(by my friend). So actually, the only way to improve DP skill is to practice more and AC different kind of DP.
could you please say me some problems in any online judges?
(⊙ˍ⊙)I'm a Chinese ACMer, I mainly solve some problems on Chinese OJ. You can find many DP problems through the tag in 'Problem Set' on CF. I learn my DP skill on this page problem ID 1003(largest sub-string) 1081(largest sub-rectangle) 1159(longest common sub-sequence) 1025(longest increasing sub-sequence) 2602 1059(two package problem) is some primary problem. If you are satisfied with the problem, you may solve other problem on the list, just skip ones with Chinese description. It may be hard for you to find the solution as you can't read others' solution on HduOJ. HUST is another big OJ in China, you may register an account and search the solution in 'STATUS' (OJ 'HDU' 'Accepted'), you can see the code of solution by clicking green ones below language.
Any tips to improve everything including dp?.. except practice what else??
except practice what else??
Get a brain transplant (if that is even possible). That's pretty much all you need. My condolences that God didn't give you a brain that is as good as those of red coders. Lmao.
On a more serious note, please get a life. Not everyone is suited for CP.
Just with one thing. "Practice"
There are lots of problem about DP on codeforces , LightOJ or other websites.
You can start with easiest one. Then you will see you are improving day by day.
solve the problems in these answers on Quora
when you are thinking about the solution try to solve it with recursion and memorization,don't submit the recursion/memorization solution,after your solution is right you can easily convert it to DP.
Don't forget to practice a lot ,because better results needs hard working :)
I'm telling you to do this because this is the strategy to start DP(because DP is an optimization for recursion),sorry for my bad English.
Is there any resource how to convert memoization to DP?
Just think about what dp results you need to construct some larger dp result. In recursion, you would say something like:
If you think about program flow, once the function dp hits its base cases, then it starts returning answers to increasingly larger problems. So you know later indices depend only on earlier ones, so you iterate from earliest to latest indices in your recursion.
Try reading this...
Read some solutions in recursion and DP (the solution is for the same problem) and you'll understand... It may be hard in the beginning...,but don't stop practicing :)
sorry for my bad English
Now you are master can u tell how u did it??
Here some questions. My teacher gave them to me. And I be better at Dp.
Number of ways
Daemon and wifi
given length and sum of digits
quasi binary
Boredom
ultra-fast mathematician
soldier and number game
Flowers
Password
Caesar's Legions
Barcode
Mr. Kitayuta, the Treasure Hunter
Pashmak and Graph
Red-Green Towers
Little Pony and Harmony Chest
Hope you enjoy :))
I can teach you lessons on dp. But it will cost 100$ per lesson. Believe me you'll be the best in dp.You maybe will beat tourist after my lessons.
I need you to teach me how to become strong in self confidence :)
Interesting
Since necroposting this became the new thing, i just want to point out how cool it is to see people blogs of people asking relatively simple stuff that became orange/red a couple of years later