lbz8o8 的博客

USACO 2007 Dec Silver 2.Building Roads做了 第一道 最小生成树 hehe#include<stdio.h>#include<iostream>#include<algorithm>#include<math.h>#include<functional>using namespace std;typedef long long ll;int n,m;

并查集 按边长从小到大排序 http://blog.youkuaiyun.com/zhuml123/article/details/51722485很巧妙的想法#include<stdio.h>#include<iostream>#include<algorithm>using namespace std;int n,m;int s,t;struct edd{ int x; i