 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:这题英文比题本身要难,说下我的理解，见笑In Reply To:这题英文比题本身要难,说下我的理解，见笑 Posted by:Hirl at 2010-04-13 22:33:13 > 给你n个人的联系情况，对任意一个人，求出这个人发消息到其他n-1个人的时间，判断是否从这点可以到达其他所有点，如果可以的话，输出所有可连通路线的中的包含最小两点之间距离的的那个起点，以及最小边。如果网络不通，那就输出disjoint Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
