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 |
用枚举最后到park的路径里<=限制的度的边 再用最小生成树连 对吗?In Reply To:两种都可以,对应的是两种不同的算法 Posted by:dynamic at 2004-01-11 18:52:35 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator