= 배경지식 =
http://en.wikipedia.org/wiki/Dynamic_programming

Introduction To Algorithm 에도 이에 대한 설명이 있습니다.


= 관련된 예제 =
== 0,1 Knapsack Problem ==
[http://mat.gsia.cmu.edu/classes/dynamic/node5.html#SECTION00050000000000000000]

== Dijkstra's Shortest Path Algorithm ==
[http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml]

== Optimal Binary Search Tree ==
[http://linneus20.ethz.ch:8080/binary.html]

= 문제 =
== [금고] ==