USACO算法系列三——agrinet

    题目：http://www.nocow.cn/index.php/Translate:USACO/agrinet

    这道题目没什么好说的，求图的最小生成树问题。有两种算法Kruskal算法和Prim算法。但是看了USACO的参考答案以后，发现自己对空间的利用还是不够。知道思想，如何用简单利索的语言实现，高效而准确。

#include <iostream> #include <fstream> #define MAX 100 #define LARGE 999999999 using namespace std; int n =0; int map[MAX][MAX] = {0}; int record[MAX]; int result = 0; int main() { ifstream fin("agrinet.in"); ofstream fout("agrinet.out"); //输入数据 fin >> n; for (int i=0; i < n; i ++) { for (int j =0; j < n; j ++) { fin >> map[i][j]; } } for (int i=0; i < n; i ++) { record[i] = i; } int minPath = LARGE; int start = -1; int end = -1; //Kruskal最小生成树算法 for(int k=0; k < n-1; k ++) { for (int i=0; i < n; i ++) { for (int j=i+1; j < n; j ++) { if (minPath > map[i][j] && map[i][j] != -1) { minPath = map[i][j]; start = i; end = j; } }//end for j }//end for i if (record[start] == record[end]) { map[start][end] = -1; k --; } else { int temp = record[end]; for (int x =0; x < n; x ++) { if (record[x] == temp) { record[x] = record[start]; } }//end for x result += minPath; map[start][end] = -1; } minPath = LARGE; }//end for k fout<<result<<endl; return 0; }

 

 

 

    业精于勤荒于嬉，形成于思毁于随。