Detail of message

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

dp

Posted by xfxyjwf at 2006-08-14 22:06:29 on Problem 2969
In Reply To:bfs? Posted by:bluewind at 2006-08-14 22:01:06

Followed by:

greedy (0) RoBa 2006-08-14 22:49:11
我用的三维dp，感觉贪心要简单点，dp不太好记路径，大家是怎样dp的？也是三维？ (0) xiaolonghingis 2006-08-14 22:52:42
- 二维,不需要记录路径 (357) xfxyjwf 2006-08-14 23:18:19
  - 刚过的，WA的不行了，觉得排序以后DP比较好吧． (381) nuanran 2006-08-14 23:34:49
    - 我想是dp[i][j][k]，0<i<n(第i位），0<j<3(余数为j），k=0,1(表示最后一个选不选），有点像2889那道题 (0) xiaolonghingis 2006-08-14 23:42:06

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator