HDU - 1875 (最小生成树)
摘要:
"题目链接" 思路:把每个顶点编号,点之间的距离 =10且 include include using namespace std; const int N = 110; struct node{ int u, v; double w; }q[N N]; int n, m, cnt; int xx[ 阅读全文
posted @ 2018-10-23 18:48 坤sir 阅读(149) 评论(0) 推荐(0) 编辑