 |
| ||||
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:线扫+局部剪枝，可在200MSAC，时间复杂度为O(n^2)，请问有没有更优算法，请mail我，谢谢In Reply To:线扫+局部剪枝，可在200MSAC，时间复杂度为O(n^2)，请问有没有更优算法，请mail我，谢谢 Posted by:blablabla at 2007-05-11 11:42:54 离散化+带权并查集, 141MS ac,只能做到这一点了 囧~ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
