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

Orz了,用了一个不知道怎么证明的剪枝。。结果刚刚过

Posted by AngelClover at 2009-02-17 01:36:24 on Problem 3134
就是记录下到每个数的最小变换次数。然后当前深度大于当前最小深度时剪掉。

据说是因为
观察可以发现不在同一层的相同值,该值最优解的路径上总能组合出另一路径上任何值
且值出现时的层数不会比另一路径上深。。。。。

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