Detail of message

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

实在搞不懂了，过了1459的最大流搬到1149就wa，搬1087的最大流却又瞬间ac了

Posted by frkstyc at 2005-05-07 00:44:17 on Problem 1459
In Reply To:直接bfs找增广路就过了，是不是顶点间有多条边的网络要拆边才能用最短增广路和预流推进？ Posted by:frkstyc at 2005-05-06 11:19:10

Followed by:

建议你去做Ditch,USACO的数据通常比较强..... (0) palmtenor 2005-05-07 14:16:55
- Re:建议你去做Ditch,USACO的数据通常比较强..... (9) frkstyc 2005-05-07 14:17:36
  - 1273,Drainage Ditches,经典的网络流，我用这个题写了好多网络流的模版，没有一个在别的题wa的 (13) palmtenor 2005-05-07 14:19:21
    - 这个也没有问题，只是被两个点之间的多条同向路阴了一次 (0) frkstyc 2005-05-07 17:31:50
    - Re:1273,Drainage Ditches,经典的网络流，我用这个题写了好多网络流的模版，没有一个在别的题wa的 (0) blackchicken 2010-04-29 18:44:27
    - Re:ditch数据弱，ed-kp0ms，不适合测试 (23) linusc 2011-01-02 14:17:31

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator