 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
我是在t+x的时候在重新贪心，这样枚举他的最后目的地n次，每次都重新贪心法算一次，o(n^2)In Reply To:应该不能贪心，要用dp的 Posted by:hawk at 2005-05-12 10:34:25 > 因为比如时间t的时候方案a钓到的鱼最多 > 到t+x的时候，前t时间还用a方案不能保证能达到t+x时候的最优解 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
