 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:这样子做为何不对？In Reply To:这样子做为何不对？ Posted by:ACM06019 at 2006-10-19 01:10:47 > 先dijkstra求出最短路， > 再dp[i]表示到达i点的路径数目 > 则如果j和i相临而且从i到j符合提仪 > 在dp[j] += dp[i]； > Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
