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

胡猜过去，不知道怎么证明 hoho

Posted by Chojin at 2008-04-30 20:13:53 on Problem 3352 
求出所有割边，删除全部割边得到若干个连通分支，每个连通分支缩成一个点，这些点用
原来的割边连接，形成一棵树，树叶的个数为N,那最少需要添加的边数是
N%2==0?(N/2):((N+1)/2)
俺用一些具体数据验证了正确性，但是不知道怎么证明。。。
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