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 richardxx at 2008-10-17 13:03:09 on Problem 1160
In Reply To:过路大牛,询问此题,见内 Posted by:richardxx at 2008-10-16 23:10:11
> 此题传说中有O(VlgP)的算法,不知道有没有人搞出来过?
> 另外一个是O(np)的算法,毛子青论文的那个方法最后的决策区间是K(p-1,n)<=K(p,n)<=K(p,n+1),此时在算m(p,n),哪里知道K(p,n+1)?不知道写出来的同学能不能给个提示?
> 还有,有没有设计出其他复杂度算法的同学?我最少得到O(n^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