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

这个样子似乎sample都不过

Posted by lastone at 2006-12-07 21:06:11 on Problem 2391
In Reply To:这题我这么搞为什么不对? Posted by:RoBa at 2006-12-07 19:32:57
> floyd预处理出所有点对的最短路。二分答案k,把每个牛棚看作一个点,构造一个网络,将S和当前牛数>可容纳牛数(设差为delta)的牛棚连一条容量为delta的边,将所有当前牛数<可容纳牛数的点到T连一条容量为delta的边,这两种点之间的最短距离如果不大于k就连一条容量为正无穷的边。求最大流,看能否填满所有从S发出的边。
> 
> 要是TLE我就认了,为什么WA捏~~

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