DP

Reusable dynamic-programming routines and common sequence problems.

Header	Summary
knapsack.hpp	0/1 knapsack. items are (weight, value) pairs. O(NlogN + L^2).
longest_increasing_subsequence.hpp	Compute indices of a longest strictly increasing subsequence.