Dynamic Programming

Dynamic Programming Practice Problems

CODE
1. Maximum Value Contiguous Subsequence
NOTE: This algorithm skip the special case that all values are negative in the array.












2. Longest Increasing Subsequence
3. Integer Knapsack Problem (multiple copies)
4. Integer 0/1 Knapsack Problem
See ~/Algorithm/Dynamic_Programming/dp/dp.cpp

Data Structure

Tree:
Tree(data structure) - Wiki
Binary Tree - Wiki; Binary Search Tree - Wiki
AVL Tree - Wiki
Quadtree - Wiki