摘要:
今天做了数据结构的专项练习 题目是hdu1102 最开始没想明白,一直纠结于怎么把已经有的边并入最小树种题目Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A an
阅读全文
posted @ 2012-08-08 21:23
BUG易
阅读(136)
推荐(0)
编辑