 |
| ||||
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:用求最短路的O(n^3)的算法改改就可以了。In Reply To:Re:用求最短路的O(n^3)的算法改改就可以了。 Posted by:476367795 at 2009-03-09 21:23:55 对吗?如果p[i][k]=p[k][j]=2；p[i][j] = 3； p[i][j]不是要等于2吗，那还是最短路吗？ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
