最小產生樹裸題hdu 1102 Constructing Roads

#include<stdio.h>#include<string.h>#define MAX 109#define MA 9999999bool vis[MAX];int w[MAX][MAX];int yes[MAX][MAX];int min,i,j,t,k,n,f,begin,end,g;__int64 s;void prim(){for(i=0;i<n-1;i++){f=0;min = 9999998;for(j=1;j<=n;j++)if(vis[j])for(k=1;k<=n;k++)if(!vis[k])if(w[j][k]<min){min=w[j][k];//g=j;f=k;}vis[f]=true;s+=min;/*vis[f]=true;if(yes[g][f] && yes[f][g])s+=min;*/}}int main(){while(scanf("%d",&n)!=EOF && n){memset(yes,1,sizeof(yes));memset(vis,false,sizeof(vis));memset(w,MA,sizeof(w));s=0;for(i=1;i<=n;i++)for(j=1;j<=n;j++)scanf("%d",&w[i][j]);scanf("%d",&t);/*for(i=1;i<=t;i++){scanf("%d%d",&begin,&end);yes[begin][end]=yes[end][begin]=0;}/*/for(i=1;i<=t;i++){scanf("%d%d",&begin,&end);w[begin][end]=w[end][begin]=0;//為此而深深糾結過，你懂的。}vis[1]=true;prim();printf("%I64d\n",s);}return 0;}