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

网络流+枚举

Posted by wywcgs at 2006-08-26 15:50:32 on Problem 1815
In Reply To:Re:这个题用什么方法做？可以说一下吗？ Posted by:Venice at 2006-08-26 15:46:48

Followed by:

Re:网络流+枚举 (7) Venice 2006-08-26 16:02:06
- Re:网络流+枚举 (18) lastone 2006-08-31 14:41:44
Re:网络流+枚举 (19) Venice 2006-09-03 16:09:42
是O(V)枚举拿掉的点再每次求最大流么? 感觉这样复杂度好高... (0) LongHell 2006-09-03 21:05:32
- 网络流的复杂度本来就是极度悲观的界，一般情况到不了的 (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