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 wolfchuyan at 2007-08-07 02:00:40 on Problem 3321 
原来以为这道题是先建立领接表从底往上回归到1，同时建立并查集的father数组，用并查集维护整个树形，自己这样觉得已经很快，实现也有点难度，最后还是超时。线段树～～～无法想象的算法～～
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