A. 动态规划法(Dynamic Programming) B. 分治法(Divideand Conquer) C. 回溯法(Backtracking) D. 分枝定界法(Branch and Bound)
A. 20 B. 18 C. 16 D. 15