Differences

This shows you the differences between two versions of the page.

--- courses:a4b36acm1:2013_zs:seminar_04 [2018/10/03 03:51]
+++ courses:a4b36acm1:2013_zs:seminar_04 [2018/10/03 03:51] (current)
@@ Line 1: / Line 1: @@
+==== Dynamické programování ====
+**Přehledy a ukázky**\\
+V Programátorských kuchařkách z MFF UK  [[http://ksp.mff.cuni.cz/study/cooks/cookbook.html| (kuchařky)]]  je dobře popsáno DP:
+[[https://ksp.mff.cuni.cz/tasks/24/cook2.html| html výklad I ]], [[http://ksp.mff.cuni.cz/tasks/17/cook5.html| html výklad II]], [[http://ksp.mff.cuni.cz/study/cooks/cookbook-chapters/09-dynamicke-programovani.pdf| přibližně shrnuto v pdf.]]\\
+Ve "světové" literatuře:\\
+S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani: Algorithms,  Mcgraw-Hill Higher Education, 2006, [[http://www.amazon.de/Algorithms-Sanjoy-Dasgupta/dp/0073523402/ref=sr_1_1?ie=UTF8&qid=1345655823&sr=8-1|link]], [[http://www.cs.berkeley.edu/~vazirani/algorithms.html | pdf. ]],
+Kap. 6 s DP : [[http://www.cs.berkeley.edu/~vazirani/algorithms/chap6.pdf| kap. 6]]\\
+T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, 3rd ed., MIT Press, 2009,  [[http://en.wikipedia.org/wiki/Introduction_to_Algorithms| link]], DP je v Kap. 15.\\
+I naše ukázky: {{:courses:a4b36acm:2013_ls:dp.pdf|Dynamické programování}}  \\
+  * [[http://www.spoj.com/problems/MARTIAN/|Martian Mining]]
+  * [[http://www.spoj.com/problems/AIBOHP/|Aibohphobia]]
+  * [[http://www.spoj.com/problems/MMAXPER/|Rectangles Perimeter]]
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2890|11790 - Murcia's Skyline]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=78&page=show_problem&problem=2701|11654 - Arithmetic Subsequence]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=27&page=show_problem&problem=2547|11552 - Fewest Flops]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=117&page=show_problem&problem=2882|11782 - Optimal Cut]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=26&page=show_problem&problem=2427|11432 - Busy Programmer]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2181|11240 - Antimonotonicity]] \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=78&page=show_problem&problem=2664|11617 - An Odd Love]] \\
+-------------
+**Pro nenasytné :)** \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=27&page=show_problem&problem=2591|11555 - Aspen Avenue]]\\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=78&page=show_problem&problem=2727|11680 - Dragster]]\\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1500| Blocks 10559]]  \\
+  * [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=142&page=show_problem&problem=47| History Grading 111]] \\