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 Loger at 2004-05-16 12:32:38 on Problem 1067
In Reply To:Re:算法没错,当时我就是考它过了的 Posted by:uni at 2004-05-16 11:42:32
虽然我还没有真正的学算法复杂度的分析

不过我觉得我的程序的复杂度不应该是T(N)
我不知道真正的复杂度是什么
不过我觉得程度中的循环次数主要是由k觉得
而k意义大概是
max(n1,n2}处在{1,2,3,5,8,13,21。。。}这个数列中第k个数和第k
+1个数之间
所以应该也是接近log(n)

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