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 |
也就是说 n^3 的最短路?In Reply To:枚举最高等级的人,然后求最短路 Posted by:xfxyjwf at 2006-03-15 17:33:32 这组数据是多少呢? 1 4 10000 2 1 2 4000 6000 3 1 3 2000 3000 2 1 4 1000 1000 1 0 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator