摘要：
1232模板题View Code 1 #include <stdio.h> 2 #include<string.h> 3 int father[1001]; 4 int find(x) 5 { 6 if(x!=father[x]) 7 father[x] = find(father[x]); 8 return father[x]; 9 }10 void union1(int x,int y)11 {12 father[x] = y;13 }14 int main()15 {16 int i,j,k,n,m,a,b;17 while(scanf(... 阅读全文
摘要：
http://poj.org/problem?id=2485很裸的最小生成树View Code 1 #include<stdio.h> 2 #include<string.h> 3 #define INF 100000 4 int w[1001][501]; 5 int visit[1001],low[1001],max; 6 void prime(int n) 7 { 8 int i,j,k; 9 memset(visit,0,sizeof(visit));10 visit[1] = 1;11 for(i = 2; i <= n ; i... 阅读全文