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

标准的裸的01背包

Posted by lh0823 at 2009-07-29 18:18:45 on Problem 3624 
for (i = 0; i < n ; i ++) {
	for (j = m; j >= w[i]; j --) {
		dp[j] = max(dp[j], dp[j - w[i]] + d[i]);
	}
}
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