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

Re:这个题用DFS确实是可以过的,但是用DFS过只不过是运气好罢了,最好的算法不是搜索,是图论最短路

Posted by Poznan_Napinators at 2006-03-15 18:14:36 on Problem 1062
In Reply To:这个题用DFS确实是可以过的,但是用DFS过只不过是运气好罢了,最好的算法不是搜索,是图论最短路 Posted by:xfxyjwf at 2005-08-03 11:43:37 
ął只不ćććććććććććććóóóęęąąąąąźźźźźźźźźźźźźżżżżżżźźżżżżżżż运气好罢了,最好的算法不是搜索,是图论最短路BFS

Dijkstra :)
O(45*n^35425-ln(cos(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