 |
| ||||
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 | |||||||||
这个题目不就是先建最少生成树，然后去掉最长的s-1条边，再在树上找最长的边吗？这个题目不就是先建最少生成树，然后去掉最长的s-1条边，再在树上找最长的边吗？应该是这样的，为什么WA了？真是搞不懂啊 大牛们，有空指点一下！多谢！ Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
