作者sophialiege (别忘了)
看板ACMCLUB
标题Re: [问题] 10259 Hippity Hopscotch
时间Thu Feb 24 20:27:18 2005
※ 引述《DJWS (...)》之铭言：
: 有人说这一题用DP可以做出来呢
: 不过我却想不出来
: 有人可以提供一些想法吗? 谢谢 ^^
DP.
try to remember each location's maximum pennies can be collected,
(starting from the location)
I think you haven't noticed the sentence.
"That square must be within the jumping capability of the contestant
(say, k locations) and
must have more pennies than those that were
on the current square."
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.112.250.175