 |
| ||||
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 | |||||||||
两种方法是并查集的两种实现（至少我是这么觉得的）In Reply To:呃...没看懂...我想想 Posted by:ArXoR at 2005-03-06 13:16:48 > 我是构造一棵树,利用树中节点的深度奇偶性来区分是否同gang,貌似和你的程序效率差不多(难道...我们指的就是同一个东东?-_-b不要笑...偶不懂) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
