https://mediawiki.zeropage.org/index.php?action=history&feed=atom&title=Algorithm%2FDynamicProgramming 2026-05-14T18:59:05Z Revision history for this page on the wiki MediaWiki 1.39.8 https://mediawiki.zeropage.org/index.php?title=Algorithm/DynamicProgramming&diff=84069&oldid=prev 2026-03-26T23:56:01Z

<p>Repair batch-0001 pages from live compare</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 23:56, 26 March 2026</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l17">Line 17:</td> <td colspan="2" class="diff-lineno">Line 17:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>= 문제 =</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>= 문제 =</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== [[금고]] ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== [[금고]] ==</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;"></del></div></td><td colspan="2" class="diff-side-added"></td></tr> </table>

Maintenance script https://mediawiki.zeropage.org/index.php?title=Algorithm/DynamicProgramming&diff=27925&oldid=prev 2021-02-07T05:22:27Z

<p></p> <p><b>New page</b></p><div>= 배경지식 =<br /> http://en.wikipedia.org/wiki/Dynamic_programming<br /> <br /> Introduction To Algorithm 에도 이에 대한 설명이 있습니다.<br /> <br /> <br /> = 관련된 예제 =<br /> == 0,1 Knapsack Problem ==<br /> [http://mat.gsia.cmu.edu/classes/dynamic/node5.html#SECTION00050000000000000000]<br /> <br /> == Dijkstra&#039;s Shortest Path Algorithm ==<br /> [http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml]<br /> <br /> == Optimal Binary Search Tree ==<br /> [http://linneus20.ethz.ch:8080/binary.html]<br /> <br /> = 문제 =<br /> == [[금고]] ==<br /> </div>

imported>Unknown