 |
| ||||
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:speedcell4 at 2011-08-01 18:49:36 > RT 广搜做这题的时间复杂度貌似比并查集更低吧，O(n+m)就搞定了 我认为数据结构题，给你一堆变换，最后只有一个问题的，问题本身就有欢迎离线的性质，有时可以稍加思考一下用朴素的方法解决，往往没必要用在线的数据结构 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
