sicily 1090 Highways 最小產生樹

         題目是求最長的邊，在產生最小產生樹時，用一個變數儲存最大的值即可

 

//Prim演算法#include <iostream>#include <memory.h>#define INF 1000000#define MAX 200using namespace std;int main(){int arcs[MAX][MAX];bool isvisit[MAX];int min_weight[MAX];int N;int cases;cin >> cases;while (cases--){cin >> N;memset(isvisit, false, sizeof(isvisit));for (int i = 0; i < N; i++)for (int j = 0; j < N; j++)cin >> arcs[i][j];for (int i = 0; i < N; i++)min_weight[i] = arcs[0][i];isvisit[0] = true;int _min;int hold, result = 0, max_weight = 0;for (int i = 1; i < N; i++){_min = INF;for (int j = 0; j < N; j++){if (!isvisit[j] && min_weight[j] < _min){_min = min_weight[j];hold = j;}}max_weight = max(max_weight, _min);result += _min;isvisit[hold] = true;for (int j = 0; j < N; j++)if (!isvisit[j] && arcs[hold][j] < min_weight[j])min_weight[j] = arcs[hold][j];}cout << max_weight << endl ;if (cases != 0)cout << endl;}return 0;}