hdu 1102 Constructing Roads
摘要：
此题是最小生成树的基础题#include<stdio.h>#include<string.h>#include<stdlib.h>int set[124],n,t,a,b,c;long long min;struct map{ int x,y,val;}m[ 100000 ];int cmp( const void *a,const void *b ){ return ( ( map * ) a ) -> val - ( ( map * ) b ) -> val;}int find( int i ){ return set[ i ] == i ? 阅读全文
posted @ 2011-03-02 19:48 LeeBlog 阅读(156) 评论(0) 推荐(0) 编辑