 |
| ||||
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:路过的大牛们给个思路！！！！！！！！！！！！！！！！！！！！！！！！In Reply To:路过的大牛们给个思路！！！！！！！！！！！！！！！！！！！！！！！！ Posted by:smallcircle at 2008-04-12 15:47:30 枚举每一条不覆盖的边，然后用线段树算，最坏复杂度O(NPlogN)好点的话可以提前结束。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
