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 |
dijk的变种……In Reply To:遍历所有从起点到终点的路径,找出所有路径中负载最大的.用DP可以了,dijkstra当然是DP,但是用来求最短路的吧? Posted by:sunmoonstar_love at 2005-06-14 17:25:40 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator