 |
| ||||
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:自己写的n^2logn算法tle,看了解题报告说有nlogn算法,但没有看懂,求大牛指点啊In Reply To:自己写的n^2logn算法tle,看了解题报告说有nlogn算法,但没有看懂,求大牛指点啊 Posted by:abcd0311 at 2009-03-11 17:38:07 > 自己写的n^2logn算法tle,看了解题报告说有nlogn算法,但没有看懂,求大牛指点啊 没读错题的话， 感觉只需要10次最短路就行了，因为ri<=10,所有相等的 ri 打包进行一次 dijkstra 算出总的最短路最小值就行了。。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
