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[i][j]=dp[i][j-1]+dp[i-1][j/2] O(N^2) 不是更简单啊?

Posted by ecjtunh at 2007-05-16 22:39:08 on Problem 2193
In Reply To:用DP。 dp[i][j]表示从前j个数中选出i个满足条件的组合数 Posted by:wrong123 at 2005-12-12 00:38:04


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