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

这题就是求从顶点1到N的最大路径的最小权边

Posted by LorinM at 2009-06-10 01:10:11 on Problem 1797
开始看成求最大生成树的最小权边,用Kruskal变形做WA了。。
明白题意后依然用Kruskal变形做莫名的RE,于是用Dij变形做才AC,题目没看清,后面要end of line一下 于是又PE了一次,太纠结了。
程序用了1.8M,发现自己越来越水了。

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