题目大意:
给出n的地点,给出一个n*n的矩阵,其第 i 行 第 j 列代表点 i 到点 j 的距离
求最小生成树的权值和
明显的简单最小生成树
Kruskal 算法做法如下:
Result : Accepted Memory : 236 KB Time : 16 ms
/*
* Author: Gatevin
* Created Time: 2014/7/17 0:15:45
* File Name: test.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
int V,E;
int u[5000];
int v[5000];
int w[5000];
int r[5000];
int f[110];
bool cmp(const int& i, const int& j)
{
return w[i] < w[j];
}
int find(int i)
{
if(i != f[i])
{
f[i] = find(f[i]);
}
return f[i];
}
int Kruskal()
{
for(int i = 1; i <= V; i++) f[i] = i;
sort(r + 1, r + E + 1, cmp);
int answer = 0;
for(int i = 1; i <= E; i++)
{
int e = r[i];
int rx = find(u[e]);
int ry = find(v[e]);
if(rx != ry)
{
f[rx] = ry;
answer += w[e];
}
}
return answer;
}
int main()
{
int tmp;
while(scanf("%d",&V) == 1)
{
E = 0;
for(int i = 1; i <= V; i++)
{
for(int j = 1; j <= V; j++)
{
scanf("%d",&tmp);
if(i > j)
{
E++;
u[E] = i;
v[E] = j;
w[E] = tmp;
r[E] = E;
}
}
}
int ans = Kruskal();
printf("%d\n",ans);
}
return 0;
}
Prim算法做法如下:
Result : Accepted Memory : 292 KB Time : 16 ms
/*
* Author: Gatevin
* Created Time: 2014/7/17 0:27:27
* File Name: test.cpp
*/
#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;
int V,tmp;
int dis[110];
bool vis[110];
vector <pair<int, int> > g[110];
const int inf = 0x7fffffff;
int Prim()
{
memset(vis, 0, sizeof(vis));
fill(dis + 1, dis + V + 1, inf);
dis[1] = 0;
int ret = 0;
for(int i = 1; i <= V; i++)
{
int mark = -1;
for(int j = 1; j <= V; j++)
{
if(!vis[j])
{
if(mark == -1)
{
mark = j;
}
else
{
if(dis[mark] > dis[j])
{
mark = j;
}
}
}
}
if(mark == -1) break;
vis[mark] = 1;
ret += dis[mark];
for(int j = 0; j < g[i].size(); j++)
{
if(!vis[g[mark][j].first])
{
int x = g[mark][j].first;
dis[x] = min(dis[x], g[mark][j].second);
}
}
}
return ret;
}
int main()
{
while(scanf("%d",&V) == 1)
{
for(int i = 1; i <= V; i++)
{
for(int j = 1; j <= V; j++)
{
scanf("%d",&tmp);
if(i > j)
{
g[i].push_back(make_pair(j, tmp));
g[j].push_back(make_pair(i, tmp));
}
}
}
int ans = Prim();
printf("%d\n",ans);
for(int i = 1; i <= V; i++)
{
if(!g[i].empty())
{
g[i].clear();
}
}
}
return 0;
}