※ 引述《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