#include <iostream> #include<algorithm> using namespace std; #define maxnum 100 int tree[maxnum]; int height[maxnum]; struct edge{ int from; int to; int weight; }edges[maxnum*(maxnum-1)/2]; bool compare(edge x,edge y){ return x.weight<y.weight; } void initial(int n){ for(int i=1;i<...
