| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
征集算法。。请问:给你一个图,求删除一个点之后,使图的块数最多,输出最多的个数,怎么求。1000-个节点。 再一个:一棵树,每个边有个权值,输入一个数M,能不能在树里面找到相连的边,边权值和等于这个数。怎么做?节点10000个。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator