還是暢通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 52590 Accepted Submission(s): 23848
當N爲0時,輸入結束,該用例不被處理。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 110
#define INF 0x3f3f3f3f
using namespace std;
int map[N][N];
int vis[N];
int dis[N];
int ans,n;
void prim()
{
int i,j,min,pos;
for(i=1;i<=n;i++)
{
dis[i] = map[1][i];
vis[i] = 0;
}
vis[1] = 1;
for(i=1;i<=n-1;i++)
{
min = INF;
for(j=1;j<=n;j++)
{
if(!vis[j] && dis[j] < min)
{
min = dis[j];
pos = j;
}
}
ans += min;
vis[pos] = 1;
for(j=1;j<=n;j++)
{
if(!vis[j] && dis[j] > map[pos][j])
{
dis[j] = map[pos][j];
}
}
}
}
int main()
{
int m,i,j,u,v,w;
while(~scanf("%d",&n) && n)
{
ans = 0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i == j)
map[i][j] = 0;
else
map[i][j] = INF;
}
}
for(i=1;i<=n*(n-1)/2;i++)
{
scanf("%d %d %d",&u,&v,&w);
map[u][v] = map[v][u] = w;
}
prim();
printf("%d\n",ans);
}
return 0;
}