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 |
一次AC,娣婕珂丝特拉算法,稍微处理了一下等级限制可能表达得不是很准确,比如酋长等级是3,限制是2,就利用dijkstra算法枚举等级为123、234、345的结点组成的子图的从旅行者结点到聘礼结点的最短路径,选取最小值就是结果 数据结构是关键 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator