Оптимизации динамического программирования: различия между версиями
Перейти к навигации
Перейти к поиску
Ctrlalt (обсуждение | вклад) Нет описания правки |
Ctrlalt (обсуждение | вклад) Нет описания правки |
||
| Строка 1: | Строка 1: | ||
== Ссылки == | == Ссылки == | ||
* [http://algorithmica.org/ru/dp-optimizations | Теория: | ||
* [http://algorithmica.org/ru/dp-optimizations algorithmica.org — Пересчёт динамики по слоям] | |||
* algocode.ru — Оптимизации динамики: [http://wiki.algocode.ru/index.php?title=%D0%9C%D0%BE%D0%BD%D0%BE%D1%82%D0%BE%D0%BD%D0%BD%D0%BE%D1%81%D1%82%D1%8C_%D1%82%D0%BE%D1%87%D0%BA%D0%B8_%D0%BF%D0%B5%D1%80%D0%B5%D0%B3%D0%B8%D0%B1%D0%B0 1], [http://wiki.algocode.ru/index.php?title=Divide%26Conquer_%D0%BE%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F 2], [http://wiki.algocode.ru/index.php?title=%D0%9E%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F_%D0%9A%D0%BD%D1%83%D1%82%D0%B0 3], [http://wiki.algocode.ru/index.php?title=Convex_hull_trick 4], [http://wiki.algocode.ru/index.php?title=%D0%94%D0%B5%D1%80%D0%B5%D0%B2%D0%BE_Li_Chao 5], [http://wiki.algocode.ru/index.php?title=%D0%9B%D1%8F%D0%BC%D0%B1%D0%B4%D0%B0-%D0%BE%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F 6] | * algocode.ru — Оптимизации динамики: [http://wiki.algocode.ru/index.php?title=%D0%9C%D0%BE%D0%BD%D0%BE%D1%82%D0%BE%D0%BD%D0%BD%D0%BE%D1%81%D1%82%D1%8C_%D1%82%D0%BE%D1%87%D0%BA%D0%B8_%D0%BF%D0%B5%D1%80%D0%B5%D0%B3%D0%B8%D0%B1%D0%B0 1], [http://wiki.algocode.ru/index.php?title=Divide%26Conquer_%D0%BE%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F 2], [http://wiki.algocode.ru/index.php?title=%D0%9E%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F_%D0%9A%D0%BD%D1%83%D1%82%D0%B0 3], [http://wiki.algocode.ru/index.php?title=Convex_hull_trick 4], [http://wiki.algocode.ru/index.php?title=%D0%94%D0%B5%D1%80%D0%B5%D0%B2%D0%BE_Li_Chao 5], [http://wiki.algocode.ru/index.php?title=%D0%9B%D1%8F%D0%BC%D0%B1%D0%B4%D0%B0-%D0%BE%D0%BF%D1%82%D0%B8%D0%BC%D0%B8%D0%B7%D0%B0%D1%86%D0%B8%D1%8F 6] | ||
* [ | * [https://codeforces.com/blog/entry/8219 codeforces.com — Dynamic Programming Optimizations] | ||
* [https://codeforces.com/blog/entry/47764 | * [https://codeforces.com/blog/entry/47764 codeforces.com — 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 | * [https://cp-algorithms.com/dynamic_programming/knuth-optimization.html cp-algorithms.com — Knuth's Optimization] | ||
* [https://usaco.guide/plat/DC-DP usaco.guide — Divide & Conquer DP] | |||
* [https://usaco.guide/adv/dp-more usaco.guide — Additional DP Optimizations and Techniques] | |||
* [http://jeffe.cs.illinois.edu/teaching/algorithms/notes/D-faster-dynprog.pdf Erickson J. Advanced Dynamic Programming] | |||
* 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)] | ||
[[Категория:Динамическое программирование]] | [[Категория:Динамическое программирование]] | ||
Текущая версия от 14:07, 28 июня 2023
Ссылки
Теория:
- algorithmica.org — Пересчёт динамики по слоям
- algocode.ru — Оптимизации динамики: 1, 2, 3, 4, 5, 6
- codeforces.com — Dynamic Programming Optimizations
- codeforces.com — Non-trivial DP Tricks and Techniques
- cp-algorithms.com — Divide and Conquer DP
- cp-algorithms.com — Knuth's Optimization
- usaco.guide — Divide & Conquer DP
- usaco.guide — Additional DP Optimizations and Techniques
- Erickson J. Advanced Dynamic Programming
- Xiao J. Convex Hull Trick, Knuth's Optimization, Divide and Conquer Optimization
- Ахмедов М. Dynamic programming optimizations
- Копелиович С. Лекция по динамике (ЗКШ 2017)