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 timeloop at 2008-08-08 18:38:04 on Problem 3678
我是看校友AC的代码的,自己甚至没动手写(表BS我,我是因为没时间).我看了代码一开始觉得时间上界是2^n,但是后来仔细想了下,发现时间上界远小于这个值,直觉感觉是2^sqrt(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