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

可以贪心的(lrj的书上有)

Posted by windbells at 2005-05-12 12:01:01 on Problem 1042
In Reply To:应该不能贪心，要用dp的 Posted by:hawk at 2005-05-12 10:34:25

> 因为比如时间t的时候方案a钓到的鱼最多
> 到t+x的时候，前t时间还用a方案不能保证能达到t+x时候的最优解

Followed by:

确实可以贪心，但应该说是基于枚举的贪心 (0) TN 2005-05-12 12:04:37
- 这个O(mnlogn)贪心的效率怎么样？我用STL的堆写的好像很慢 (0) frkstyc 2005-05-12 12:17:27
  - 我都是自己写heap (0) TN 2005-05-12 12:22:13
    - 建堆的时候每步插入快还是整体建堆快？ (26) frkstyc 2005-05-12 12:33:37
  - 效率应该比DP高吧 (0) TN 2005-05-12 12:22:36
  - 整1000 submissions了 (0) frkstyc 2005-05-12 12:31:21
- 只能说在某一步贪心了，整体算法不该说成贪心吧 (0) hawk 2005-05-12 12:28:42

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