 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:网络流水过，建边的最坏时间为O（N*M）……In Reply To:网络流水过，建边的最坏时间为O（N*M）…… Posted by:lqp18_31 at 2009-08-01 21:43:33 > rt > 这题数据弱了,所以可以直接用网络流ws,试想,如果有这种情况...,c=2500,l=2500,并且每瓶药水都对每只牛适用,那么, > 至少需要2500*2500*2+2500+2500条边,直接暴内存了.... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
