Оптимизации динамического программирования: различия между версиями

Материал из Олимпиадное программирование в УлГТУ
Перейти к навигации Перейти к поиску
Нет описания правки
Строка 5: Строка 5:
* [https://codeforces.com/blog/entry/47764 Codeforces — Non-trivial DP Tricks and Techniques]
* [https://codeforces.com/blog/entry/47764 Codeforces — Non-trivial DP Tricks and Techniques]
* [https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html cp-algorithms.com — Divide and Conquer DP]
* [https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html cp-algorithms.com — Divide and Conquer DP]
* [https://usaco.guide/plat/DC-DP USACO Guide — Divide & Conquer DP]
* Xiao J. [https://jeffreyxiao.me/blog/convex-hull-trick Convex Hull Trick], [https://jeffreyxiao.me/blog/knuths-optimization Knuth's Optimization], [https://jeffreyxiao.me/blog/divide-and-conquer-optimization Divide and Conquer Optimization]
* Xiao J. [https://jeffreyxiao.me/blog/convex-hull-trick Convex Hull Trick], [https://jeffreyxiao.me/blog/knuths-optimization Knuth's Optimization], [https://jeffreyxiao.me/blog/divide-and-conquer-optimization Divide and Conquer Optimization]
* [http://maratona.ic.unicamp.br/MaratonaVerao2017/documents/dp.pdf Ахмедов М. Dynamic programming optimizations]
* [http://maratona.ic.unicamp.br/MaratonaVerao2017/documents/dp.pdf Ахмедов М. Dynamic programming optimizations]
* [http://acm.math.spbu.ru/~sk1/mm/lections/zksh2017-dp/conspect.pdf Копелиович С. Лекция по динамике (ЗКШ 2017)]
* [http://acm.math.spbu.ru/~sk1/mm/lections/zksh2017-dp/conspect.pdf Копелиович С. Лекция по динамике (ЗКШ 2017)]
* [http://jeffe.cs.illinois.edu/teaching/algorithms/notes/D-faster-dynprog.pdf Erickson J. Advanced Dynamic Programming]
* [http://jeffe.cs.illinois.edu/teaching/algorithms/notes/D-faster-dynprog.pdf Erickson J. Advanced Dynamic Programming]

Версия от 12:47, 3 декабря 2020