摘要：
题意:求生成树,并且生成树的最大边减最小边的值最小.分析:根据最小瓶颈生成树可知,使用kruscal算法枚举最小边即可// File Name: 1395.cpp// Author: Zlbing// Created Time: 2013/4/20 13:00:15#include<iostream>#include<string>#include<algorithm>#include<cstdlib>#include<cstdio>#include<set>#include<map>#include<v 阅读全文