 |
| ||||
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 | |||||||||
不必二分。枚举所有边长下限，用KRUSKAL算法求最小生成树，该下限对应的最长的边就找到了。不超时的。In Reply To:二分答案+并查集判环N4次的算法竟然AC了 Posted by:ghb044100307 at 2008-03-09 20:47:08 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
