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

征集算法。。

Posted by sunny_fable at 2007-05-16 14:57:03
请问:给你一个图,求删除一个点之后,使图的块数最多,输出最多的个数,怎么求。1000-个节点。

再一个:一棵树,每个边有个权值,输入一个数M,能不能在树里面找到相连的边,边权值和等于这个数。怎么做?节点10000个。

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