Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:.......这么长?。。。

Posted by 006794 at 2006-10-06 19:14:21 on Problem 1018
In Reply To:Re:.......这么长?。。。 Posted by:y05hcy at 2006-10-06 15:02:34
> 真的假的…………

有种比较卑劣的方法:
   对每种设备的若干方案按price建一个最小堆
   依次从小到大枚举全部(所有设备的)price
   利用堆找到每种设备中价格小于price的带宽最大的构成当前解
   再必要时更新最优解
   设n个mi之和为m
   则复杂度为m*log(m)
   还是蛮快的

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


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