Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
Re:我写的第一个DP算法In Reply To:我写的第一个DP算法 Posted by:wlh_flame at 2009-03-21 21:30:49 > 调试了好几个小时 > 但是还好,提交一次就通过了 > > 是个相对简单的dp算法 > > P[][][2] > 先将gangster按照时间顺序排列,进行时间上的递推 > > 每个递推步骤都有K个状态 > (t[i], s0~sk, pMax)-->(t[i+1], s0~sk, pMax) > > 因为自己是个菜鸟,将思路写出,希望对初学者有帮助:) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator