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

Re:哈哈,过了这题目.有点意思.说下思路给WA的一点提示~~

Posted by qjklw at 2009-12-31 20:10:45 on Problem 2263
In Reply To:哈哈,过了这题目.有点意思.说下思路给WA的一点提示~~ Posted by:level at 2007-02-06 19:28:24
> /*		168K 31MS C++ 1372B 
> 超级卡车
> dijkstra()就可以了,但是
> 这个毕竟不同于最短路径,最短路径只要到达终点就可以了.但是这里是要找
> 到一条最大容量的路径.每次从最大容量去打,不一定会是最好的路.
> 如 A-->B 30 A-->C 100 A-->D 200 B-->E 30 C-->E 20 D-->E 20
> 按fdijkstra()的算法,先找到A-->D 200 扩展后A--E 20但是很明显A-->E的路
> 径为30,A-->B-->E.
> 所以一定要遍历全部的点才能得出答案
> */

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