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:请教成都G题,望大牛指教

Posted by zhucheng at 2005-11-08 19:24:08
In Reply To:请教成都G题,望大牛指教 Posted by:fzk at 2005-11-08 19:15:49
> 1000个节点的无向树,要连最少的边使得其无割顶,求最少边数。
> 
> 想了好久没想到,请教达人多谢~
据说答案是叶子数-1和最大度数-1两者中小的那个,不过容易找到反例。
又有人说是
枚举根,先确定一根树,然后结果就是,每个结点的孩子结点的个数-1 的和;
对所有答案(根不同答案可能不同)求最大值。
如果没理解错的话,样例都过不了。
ms大家都在猜结论。

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