Introduction - If you have any usage issues, please Google them yourself
This includes the classic example of the dynamic recursive algorithm is often used in the ACM competition, such as the knapsack problem, the longest common subsequence such as source code