※ 引述《sophialiege (別忘了)》之銘言：
: I think the author means the "memorized search".
: "A table to memorize some useful information at each level(maybe can be
: reduced into fewer ones, it depends) you search; then based on the
: information you can cut the tree into a far smaller one."
: The main idea of Dynamic Programming is something like that.
: (You can find what DP is at almost all algorithm books.)
: Finally, the quickest way to solve this problem is greedy method.
: (You can also find that at almost all algorithm books.)
我還是想不出來怎麼用不拖泥帶水的backtracking在這題上面,
書上的提示老實講,我現在還是看不懂,
一定是有某種方法我完完全全沒有想到才會這樣,
所以如果有人知道怎麼做麻煩說明一下吧.....
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.161.22.106