 |
| ||||
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 | |||||||||
总算过了，说说做法就是很普通的回溯法，每读入一组邮票面值，先进行排序，然后挨个处理每一个客户，扩展节点的时候排除所有不可能成为完整答案的或是肯定劣于当前最优解的子节点，我只是在扩展节点的函数中加入了一行与当前最优解比较后排除的代码，时间就由30MS降到了0MS Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
