pku 2485 Highways(prim)

The Flatopian government wants to minimize the length of the longest highway to be built. However, they want to guarantee that every town is highway-reachable from every other town.

给定各点之间的权值，选择边构成一个连通网络，要求其中最大边要尽量小。

这里有个性质，满足上面条件的连通网络是最小生成树，结果也即最小生成树的最大边。

 

 

#include <iostream> using namespace std; bool inTree[500]; int city_distance[500][500];//存储边权值 int min_distance[500];//非Tree结点和Tree中的结点间的min_distance int prim(int n) { int ans=0; memset(inTree,0,sizeof(inTree)); for(int i=0;i<n;i++)//一开始，所有节点都是非Tree结点 { min_distance[i]=INT_MAX; } min_distance[0]=0;//结点0作为起始结点 for(int i=0;i<n;i++) { int min_dist=INT_MAX,min_index; for(int j=0;j<n;j++) { if(!inTree[j]&&min_distance[j]<min_dist) { min_index=j; min_dist=min_distance[j]; } } inTree[min_index]=true;//将新寻找到的结点加到tree中，标记 ans=ans>min_dist?ans:min_dist; for(int j=0;j<n;j++)//将所有和min_index相连的非tree结点的min_distance更新 { if(!inTree[j]&&city_distance[min_index][j]<min_distance[j]) min_distance[j]=city_distance[min_index][j]; } } return ans; } int main() { int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { scanf("%d",&city_distance[i][j]); } } printf("%d/n",prim(n)); } return 0; }