zoj1542Network

来源:互联网 发布:最新ip代理搜索软件 编辑:程序博客网 时间:2024/06/05 08:01
//zoj1542就是一水题,sample还给错了,。。。#include"stdio.h"#include"string.h"#include"stdlib.h"#define maxint 15002typedef struct point{int s,e, length;}epoint;epoint side[maxint];int v[maxint],is[maxint];int cmp(const void *a,const void *b){epoint *p1,*p2;p1=(epoint*)a;p2=(epoint*)b;if(p1->length>p2->length)return 1;if(p1->lengthlength)return -1;if(p1->s>p2->s)return 1;if(p1->ss)return -1;if(p1->e>p2->e)return 1;else return-1;}int find(int i){while(v[i]!=i)i=v[i];return i;}int kruscal(int n,int m){int i,j=0,v1,v2;for(i=0;i<n;i++){v[i]=i;is[i]=0;}qsort(side,m,sizeof(epoint),cmp);for(i=0;i<m;i++){v1=find(side[i].s);v2=find(side[i].e);if(v1!=v2){is[j++]=i;v[v1]=v2; if(j==n-1)break;}}printf("%d\n",side[is[j-1]].length);printf("%d\n",n-1);for(i=0;i<j;i++)printf("%d %d\n",side[is[i]].s,side[is[i]].e);return 0;}int main(){int n,m,i,t=1;while(scanf("%d%d",&n,&m)!=EOF){for(i=0;i<m;i++){scanf("%d",&side[i].s);scanf("%d",&side[i].e);scanf("%d",&side[i].length);}kruscal(n,m);}return 0;}