 |
| ||||
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 | |||||||||
还有一点要注意的这道题目,只要算出1到N的最短路径就行了 也就是说题目只保证1到N可连通，并不保证其他点也是连通 所以Dijkstra只要发现Dis[n]（或者按照题意Dis[1]）改变了，就可以跳出程序了 Wa++ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
