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

Problem G

Posted by ACRush at 2009-11-01 09:51:34
In Reply To:武汉赛区比赛9:00-14:00，清华校内PK最终决战 Posted by:ACRush at 2009-11-01 08:59:48 
用价值V1，V2的Coupon和一个1-FREE购买Happiness最高的物品

非常类似背包问题，用动态规划解决。
状态(L1,L2,b)，表示第一张Coupon剩余L1，第二张Coupon剩余L2，b=01表示是否使用1-FREE

这样时间复杂度是O(V1*V2*N)，状态总数不超过500*50*300*2
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