 |
| ||||
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:这题有什么trick吗,WA了好多次In Reply To:Re:这题有什么trick吗,WA了好多次 Posted by:wrong123 at 2006-02-23 02:45:46 计算删除一条边之后 该边的起点到路径最后顶点的最短路时，用O(n^2)的Dijkstra算法可以到0ms Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
