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 wxk at 2005-10-03 13:14:58 on Problem 2626
In Reply To:这个怎么搞呢? Posted by:Trident at 2005-10-03 13:00:04
动态规划
X[1000][15][15]
X[i][w][b]=max(x[i-1][w][b],x[i-1][w-1][b]+man[i].w,x[i-1][w][b-1]+man[i].b)
WR

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