 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:用DP。 dp[i][j]表示从前j个数中选出i个满足条件的组合数In Reply To:用DP。 dp[i][j]表示从前j个数中选出i个满足条件的组合数 Posted by:wrong123 at 2005-12-12 00:38:04 > O(n^3)状态转移方程：dp[i][j] = dp[i][j] + 所有以前dp[i-1][k]值 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
