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

Re:Help

Posted by frkstyc at 2005-05-30 11:25:41 on Problem 1925
In Reply To:Help Posted by:rdeleon at 2005-05-30 06:00:29 
it's dp, based on the fact that if from x the i-th building at x_i is reachable, then 2x_i-x is reachable from that building. for each building, enumerate every x from which it's reachable.
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