poj 1258

水过一道最小生成树模板题，洗衣睡觉。。

/*poj_1258    最小生成树简单题，直接套模板。。以下为用kruskal的实现不懂这句话到底有什么用：Physically, they are limited in length to 80 characters, so some lines continue onto others.*/#include <iostream>#include <string.h>#include <cstdio>#include <queue>using namespace std;struct node{    node( int i=0,int j=0,int k=0 )    {        from=i; to=j; value=k;    }    int from,to,value;};priority_queue <node> p;int father[200],sum;bool operator<( const node &a,const node &b ){    return a.value>b.value;}int find_set( int a ){    if( a!=father[a] )    {        father[a]=find_set( father[a] );    }    return father[a];}void union_set( int a,int b,int v ){    if( a==b )  return;    father[b]=a;    sum+=v;}int main(){    int n,i,j,temp;    node t;    while( scanf( "%d",&n )!=EOF )    {        for( i=0;i<n;i++ )            father[i]=i;        for( i=0;i<n;i++ )        {            for( j=0;j<n;j++ )            {                scanf( "%d",&temp );                if( temp!=0 ) p.push( node( i,j,temp ) );            }        }        sum=0;        while( !p.empty() )        {            t=p.top();  p.pop();            union_set( find_set(t.from),find_set(t.to),t.value );        }        printf( "%d\n",sum );    }    return 0;}