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 ACM06019 at 2006-10-19 01:10:47 on Problem 2662 
先dijkstra求出最短路，
再dp[i]表示到达i点的路径数目
则如果j和i相临而且从i到j符合提仪
在dp[j] += dp[i]；
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