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:这题英文比题本身要难,说下我的理解，见笑

Posted by xijunlee93 at 2012-12-05 20:49:29 on Problem 1125
In Reply To:这题英文比题本身要难,说下我的理解，见笑 Posted by:Hirl at 2010-04-13 22:33:13 
> 给你n个人的联系情况，对任意一个人，求出这个人发消息到其他n-1个人的时间，得到n-1个时间中的最大值，n个最大值中的最小值就是所求。如果网络不通，那就输出disjoint

这道题吧，如果已经对SPFA或FLOYD算法有过了解后，读懂这个题还是比较简单的，其实就是一个SPFA模型多次用了而已，数据很水，看不懂题意的童鞋可以先熟悉下FLOYD或SPFA
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