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 |
这题就是求从顶点1到N的最大路径的最小权边开始看成求最大生成树的最小权边,用Kruskal变形做WA了。。 明白题意后依然用Kruskal变形做莫名的RE,于是用Dij变形做才AC,题目没看清,后面要end of line一下 于是又PE了一次,太纠结了。 程序用了1.8M,发现自己越来越水了。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator