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

主要是区间无重合

Posted by 10070709 at 2009-02-27 11:53:20 on Problem 3616
In Reply To:原来是简单的dp。。。我还以为。。。方程 dp[i] = max( dp[j](1<=j<=i))+int[i].w int[j].b+r<=int[i].a。。。。。 Posted by:IceKingdom at 2008-11-03 08:01:34


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