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

不是等同的,至少是特殊情况下的hamilton问题,因为约束条件非常强,每个小孩很乖,不会有多于n-1个的敌人

Posted by children_s_dining at 2005-06-24 20:27:52 on Problem 2438
In Reply To:如果把Friendly的dis设成1,!Friendly的dis设成oo,这个是不是就等同于求最短Hamilton圈了 Posted by:TN at 2005-06-24 19:53:50


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