DP¶
Reusable dynamic-programming routines and common sequence problems.
Headers¶
| Header | Summary |
|---|---|
knapsack.hpp |
同重量优化的 0/1 背包 |
longest_common_subsequence.hpp |
最长公共子序列与方案 |
longest_increasing_subsequence.hpp |
最长上升子序列与方案 |
Reusable dynamic-programming routines and common sequence problems.
| Header | Summary |
|---|---|
knapsack.hpp |
同重量优化的 0/1 背包 |
longest_common_subsequence.hpp |
最长公共子序列与方案 |
longest_increasing_subsequence.hpp |
最长上升子序列与方案 |