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

复杂度还是O(p*k)吧. 如果递推可以的话,最后的求和不会成为瓶颈.

Posted by RoBa at 2006-10-22 20:33:54
In Reply To:望大牛赐教：有关将p个可辨别的球放入k个不可辨别的可空盒子的放法数递推公式？ Posted by:jianchenhao at 2006-10-22 13:14:03 
> 假设用f(p,k)表示上述值，那么是否存在一个递推公式或者其他什么好的方法？我想到一种最原始的算法。如果另F(p,k)表示将p个可辨别的球放入k个不可辨别的非空盒子的放法数，那么f(p,k)=F(p,1)+F(p,2)+...+F(p,k),这个复杂度貌似要到O(p*k^2)?有更好的算法么？
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