前两天ICM的时候用到了克鲁斯卡尔算法解最小生成森林，不过当年NOIP学的基本都忘光了。写的不是很精练，全当练手了，有需要的就拿去啦
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 | #include <stdio.h> #include <string.h> #define MAX_POINTS 100 #define INF 99999999 double Map[MAX_POINTS][MAX_POINTS]; int Points[MAX_POINTS]; int main() { int i,j,c=0,b,f,m1,m2; double bf=0,min=0; char buffer[100]; FILE * fp; for(i=0;i<MAX_POINTS;i++) { Points[i]=0; } for(i=0;i<MAX_POINTS;i++) { for(j=0;j<MAX_POINTS;j++) { Map[i][j] = 0; } } fp = fopen("points.txt","r"); if(fp == NULL) { puts("io error!"); return 1; } while(fscanf(fp,"%d",&b)!=EOF) { Points[c++]=b; printf("%d ",b); } printf("\n%d\n",c); fclose(fp); fp = NULL; fp = fopen("map.txt","r"); if(fp == NULL) { puts("io error!"); return 1; } i=0,j=0; while(fscanf(fp,"%s",buffer)!=EOF) { sscanf(buffer,"%lf",&bf); if(i>=c) { i=0; j++; } if(j>c) break; Map[i++][j]=bf; } fclose(fp); for(i=0;i<c;i++) { for(j=0;j<c;j++) { printf("%.1lf ",Map[i][j]); } puts(""); } while(1) { f=0; m1 = m2 = 0; min = INF; for(i=0;i<c;i++) { if(Points[i]==0) { f=1; } else { for(j=0;j<c;j++) { if(Points[j]==0) { if(Map[i][j]!=0) { if(Map[i][j]<min) { min = Map[i][j]; m1 = i; m2 = j; } } } else { } } } } if(f!=1) { return 0; } printf("%d -> %d \n",m1,m2); Points[m2]=1; } return 0; } |