Description: 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
To Search:
File list (Check if you may need any files):
01-package 一维数组法.cpp
01-package和求最小背包个数 .cpp
1773数塔问题之动态规划.cpp
2185.完全背包问题模版.cpp
3125之多重背包问题.cpp
4108.01背包问题一位数组的模版.cpp
4108，01背包问题之动态规划模版.cpp
Redraiment的走法1402 就是LIS.cpp
最大子序列，也就是子段和.cpp
最大连续子段和4094.cpp
最大连续子段和开始和结束位置.cpp
最长公共子序列4093.cpp
最长单增子序列4092.cpp
Download