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:Re:DP解题思路: Posted by:oracle_ at 2014-01-22 20:18:04 > 其实就是BFS嘛 不过,貌似要重置一下那个标志dp[i][j] 不然就开成dp[n][i][j] dp[k][i][j]=max{ dp[k+1][i+d[l][0]][j+d[l][1]]} Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator