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

留给过路人.关于DP和搜索.需要强烈注意的是输出使用.3f而不要.3lf

Posted by dirtysalt at 2009-07-15 00:05:06 on Problem 1018 
设计的DP[i][j]表示考虑前面i个物品带宽为j时的最小价格.由于有效带宽的最大值没有给出所以需要动态malloc空间出来[32MS]
搜索的话枚举出所有可能的带宽然后进行暴力搜索，不过可以加入一些排序来剪枝[16MS]
最后就是输出%.3f,为此WA了N多次
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