package Backpack9Talk.chap1;

/**
 * 背包九讲学习录.
 * http://love-oriented.com/pack/P01.html
 * This is the base of backpack type DP problem:
 *  有N件物品和一个容量为V的背包。第i件物品的费用是c[i]，价值是w[i]。求解将哪些物品装入背包可使价值总和最大。
 *
 * Created this class in Backpack9Talk at 11:12 AM, 10/21/2015.
 */
public class BackpackBase {
    public static void main(String[] args) {

    }


}
