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

是O(V)枚举拿掉的点再每次求最大流么? 感觉这样复杂度好高...

Posted by LongHell at 2006-09-03 21:05:32 on Problem 1815
In Reply To:网络流+枚举 Posted by:wywcgs at 2006-08-26 15:50:32

Followed by:

网络流的复杂度本来就是极度悲观的界，一般情况到不了的 (0) wywcgs 2006-09-04 01:41:16
- 谁说的 (0) frkstyc 2006-09-04 18:04:51
  - wywcgs说的 (0) majia001 2006-09-04 19:13:42
  - 我.怎么了. (0) wywcgs 2006-09-04 19:14:34
TLE again and again... (0) LongHell 2006-09-05 11:54:56
- 请大牛再指点一下，thx... (0) LongHell 2006-09-05 12:01:45

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