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。 dp[i][j]表示从前j个数中选出i个满足条件的组合数

Posted by wrong123 at 2005-12-12 00:38:04 on Problem 2193
In Reply To:这道题我用公式做的，怎么会错 Posted by:sunmoonstar_love at 2005-07-12 20:08:37 
O(n^3)状态转移方程：dp[i][j] = dp[i][j] + 所有以前dp[i-1][k]值
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