2013年9月25日

Poj 3552 Slim Span 最小生成树

摘要： -----------------Slim SpanTime Limit:5000MSMemory Limit:65536KTotal Submissions:5725Accepted:3008DescriptionGiven an undirected weighted graphG, you should find one of spanning trees specified as follows.The graphGis an ordered pair (V,E), whereVis a set of vertices {v1,v2, …,vn} andEis a set of und 阅读全文

posted @ 2013-09-25 21:13 电子幼体 阅读(153) 评论(0) 推荐(0) 编辑

UVA 11354 - Bond 最小树/LCA/瓶颈路

摘要： -----------------------Once again, James Bond is on his way to saving the world. Bond's latest mission requires him to travel between several pairs of cities in a certain country.The country hasNcities (numbered by 1, 2, . . .,N), connected byMbidirectional roads. Bond is going to steal a vehicl 阅读全文

posted @ 2013-09-25 18:39 电子幼体 阅读(203) 评论(0) 推荐(0) 编辑

HDU 4081 Qin Shi Huang's National Road System 最小/次小生成树的性质

摘要： ------------------------------Qin Shi Huang's National Road SystemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2168Accepted Submission(s): 789Problem DescriptionDuring the Warring States Period of ancient China(476 BC to 221 BC), there were 阅读全文

posted @ 2013-09-25 14:29 电子幼体 阅读(250) 评论(0) 推荐(0) 编辑

导航