Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

呃...没看懂...我想想

Posted by ArXoR at 2005-03-06 13:16:48 on Problem 1703
In Reply To:每次把a1和e[a2]合并，a2和e[a1]合并就行了 Posted by:TN at 2005-03-06 12:47:19 
我是构造一棵树,利用树中节点的深度奇偶性来区分是否同gang,貌似和你的程序效率差不多(难道...我们指的就是同一个东东?-_-b不要笑...偶不懂)
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator