2010年5月7日

摘要: Slim SpanTime Limit:5000MSMemory Limit:65536KTotal Submissions:2261Accepted:1206DescriptionGiven an undirected weighted graphG, you should find one of spanning trees specified as follows.The graphGis ... 阅读全文
posted @ 2010-05-07 22:56 lee41sum 阅读(450) 评论(0) 推荐(1) 编辑
 
摘要: 题目:Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:12040Accepted:3493DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up... 阅读全文
posted @ 2010-05-07 21:34 lee41sum 阅读(620) 评论(0) 推荐(1) 编辑