 |
| ||||
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 | |||||||||
...给的数据都过了...还是WA...好吧 是OJ的问题...55555 附思路思路设酋长的rank为X,那么把所有顶点的rank分为这样若干个区间 [ x-m,x] ... [ x, x+m] 每个区间中都包含有一些点 把这些点建图 然后求DIJKSTRA 然后比较所有区间求出的最短路径 最小的即时所求. 过的同学,能说说这种想法有错么? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
