Dynamic Programming Solvable Problem

1. Knapsack, n items, put into size W bag, maximize the item value in the bag

1.1 n items put into 2 bag, bag size as W1, and W2

1.2 select at most k item from n, put them in the bag size of W, maximize the item value in the bag

1.3 n items put into bag size of W, maximize the item value with total weight exactly as W.  Tell if such item combination exist or not

1. Common Subsequence

1.1 POJ common subsequence, and compromise problem