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

费用流感觉也行

Posted by Gamor at 2010-09-11 21:01:55 on Problem 3204
除了增加原来的边外,然后再在每条边(x, y, 0, w)的基础上添加一条(x, y, 1, INFI),这样SPFA到距离d[SINK] == 1 时看有几次是增广距离为1的,那么就输出几。 但是其中有可能重复的,所以还要判重。

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