无知的博客

畅通工程 贪心最小生成树 #include #include #include using namespace std; int a[10001]; struct st { int x,y,len; }s[100001]; int find(int x) { while(a[x]!=x) { x=a[x]; } return x; } int un(int x,int

Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes r