bzoj 1083 题解

最小生成树

Code：

/**************************************************************
    Problem: 1083
    User: wohenshuai
    Language: C++
    Result: Accepted
    Time:32 ms
    Memory:1604 kb
****************************************************************/
 
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;
struct node
{
  int x,y,d,next;
}a[21000]; int first[310],len;
void ins(int x,int y,int d)
{
  len++; a[len].x=x; a[len].y=y; a[len].d=d;
  a[len].next=first[x]; first[x]=len;
}
void Input()
{
  scanf("%d%d",&n,&m);
  len=0; memset(first,0,sizeof(first));
  for(int i=1;i<=m;i++)
  {
    int x,y,d;
    scanf("%d%d%d",&x,&y,&d);
    ins(x,y,d); ins(y,x,d);
  }
}
bool Cmp(node x,node y){return x.d<y.d;}
int fa[310];
int find(int x)
{
  if(fa[x]==x) return x;
  else return find(fa[x]);
}
int ans,maxx;
void Solve()
{
  sort(a+1,a+len+1,Cmp);
  ans=0; maxx=-1;
  for(int i=1;i<=n;i++) fa[i]=i;
  for(int i=1;i<=len;i++)
  {
    int xx=find(a[i].x); int yy=find(a[i].y);
    if(xx!=yy)
    {
      fa[xx]=yy;
      ans++; maxx=max(maxx,a[i].d);
      if(ans==n-1) break;
    }
  }
}
void Output()
{
  printf("%d %d\n",ans,maxx);
}
int main()
{
  Input();
  Solve();
  Output();
  return 0;
}