最小生成树的题目一般比较死板,模板题。
题目描述:直接看样例即可知道如何读入,除了2395是求最大边,其他均为和。
参考程序:
1258:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define INF 0x7f7f7f7f
#define maxn 1050
using namespace std;
struct Edge{
int dist,to;
bool operator < (Edge rhs)const{
return dist>rhs.dist;
}
Edge(int dist,int to):dist(dist),to(to){}
};
int n;
struct Prim{
int n;
int map[maxn][maxn];
int ans;
int d[maxn];
bool done[maxn];
void init(int n){
this->n=n;
memset(map,0,sizeof(map));
for (int i=0;i<n;i++)
for (int j=0;j<n;j++)
scanf("%d",&map[i][j]);
}
void prim(){
priority_queue<Edge> Q;
memset(done,0,sizeof(done));
for (int i=0;i<n;i++) d[i]=INF;
d[0]=0;ans=0;
Q.push(Edge(0,0));
while (!Q.empty()){
Edge now=Q.top();Q.pop();
int u=now.to;
if (done[u])continue;
done[u]=true;
ans+=d[u];
for (int v=0;v<n;v++){
if (u != v && d[v]>map[u][v]){
d[v]=map[u][v];
Q.push(Edge(d[v],v));
}
}
}
}
}G;
int main(){
while (scanf("%d",&n)==1){
G.init(n);
G.prim();
printf("%d\n",G.ans);
}
return 0;
}
2377:
#include<cstdio>
#include<algorithm>
#define maxn 3000
#define maxm 30000
using namespace std;
int n,m;
struct Kruskal{
int n,m,ans,cnt;
int f[maxn];
pair<int,int>e[maxm];
int u[maxm],v[maxm];
void init(int n,int m){
this->n=n;
this->m=m;
for (int i=0;i<m;i++){
scanf("%d%d%d",&u[i],&v[i],&e[i].first);
u[i]--;v[i]--;
e[i].second=i;
}
for (int i=0;i<n;i++)f[i]=i;
}
int find(int x){
return f[x]=f[x]==x?x:find(f[x]);
}
void kruskal(){
sort(e,e+m);ans=cnt=0;
for(int i=m-1;i>=0;i--){
int t=e[i].second;
int x=find(u[t]),y=find(v[t]);
if (x != y){
f[y]=x;
ans+=e[i].first;
cnt++;
}
}
ans=cnt==n-1?ans:-1;
}
}G;
int main(){
scanf("%d%d",&n,&m);
G.init(n,m);
G.kruskal();
printf("%d",G.ans);
return 0;
}
2395:
#include<cstdio>
#include<algorithm>
#define maxn 3000
#define maxm 30000
#define INF 0x7f7f7f7f
using namespace std;
int n,m;
struct Kruskal{
int n,m,ans,cnt;
int f[maxn];
pair<int,int>e[maxm];
int u[maxm],v[maxm];
void init(int n,int m){
this->n=n;
this->m=m;
for (int i=0;i<m;i++){
scanf("%d%d%d",&u[i],&v[i],&e[i].first);
u[i]--;v[i]--;
e[i].second=i;
}
for (int i=0;i<n;i++)f[i]=i;
}
int find(int x){
return f[x]=f[x]==x?x:find(f[x]);
}
void kruskal(){
sort(e,e+m);ans=-INF,cnt=0;
for(int i=0;i<m;i++){
int t=e[i].second;
int x=find(u[t]),y=find(v[t]);
if (x != y){
f[y]=x;
ans=max(ans,e[i].first);
cnt++;
}
}
ans=cnt==n-1?ans:-1;
}
}G;
int main(){
scanf("%d%d",&n,&m);
G.init(n,m);
G.kruskal();
printf("%d",G.ans);
return 0;
}