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

是不是新路不能经过原来的点?我求lca然后对每一对点(u,v)找出len[u]+len[v]-2*len[lca[u][v]]-dist(u,v)最大的一个(len[u]是u到树根的树上距离,dist(u,v)是u,v的平面距离),打出来,为什么WA,有什么trick吗?

Posted by blackchaoxu at 2007-01-16 14:41:50 on Problem 3102


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