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 |
居然一个标题不能说的太长,重新在内容里说!In Reply To:这题是有很专业的数学知识的,先是看了IOI2002对这题的解题报告,但是发现算法描述得很含糊,然后看了解题报告中的参考文献“[1] J.-M. Ho, D. T. Lee, C.-H. Chang, C. K Wong, Minimum diameter spanning trees an Posted by:goalboy at 2006-03-24 14:36:34 这题是有很专业的数学知识的,先是看了IOI2002对这题的解题报告,但是发现算法描述得很含糊,然后看了解题报告中的参考文献“[1] J.-M. Ho, D. T. Lee, C.-H. Chang, C. K Wong, Minimum diameter spanning trees and related problems, SIAM J. on Computing, 20(5):987—997, 1991.”,才最终获得了详细正确的算法。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator