poj 2377 Bad Cowtractors（最大生成树）

最新推荐文章于 2019-08-26 11:24:34 发布

AlmostFree

最新推荐文章于 2019-08-26 11:24:34 发布

阅读量450

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/u013508213/article/details/37050289

版权

图论专栏收录该内容

69 篇文章 0 订阅

订阅专栏

题意是求一个树的最大生成树，若不能生成树，则输出-1。

代码：

#include <stdio.h>

const int maxn = 1001;
const int inf = 0x3f3f3f3f;

int g[maxn][maxn];
int n, m;

int prim()
{
    bool vis[maxn];
    int dis[maxn];
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        dis[i] = -inf;
        vis[i] = false;
    }
    dis[1] = 0;
    vis[1] = true;
    int mark = 1;
    for (int i = 1; i < n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j] && dis[j] < g[mark][j])
                dis[j] = g[mark][j];
        }
        int maxdis = -1;
        for (int j = 1; j <= n; j++)
        {
            if (!vis[j] && maxdis < dis[j])
            {
                maxdis = dis[j];
                mark = j;
            }
        }
        if (maxdis <= 0)
            return -1;//debug
        vis[mark] = true;
        res += maxdis;
    }
    return res;
}

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    while (scanf("%d%d", &n, &m) == 2)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                if (i == j)
                    g[i][j] = 0;
                else
                    g[i][j] = -inf;
            }
        }
        for (int i = 0; i < m; i++)
        {
            int from, to, c;
            scanf("%d%d%d", &from, &to, &c);
            if (g[from][to] < c)//debug
                g[from][to] = g[to][from] = c;
        }
        int ans = prim();
        printf("%d\n", ans);
    }
    return 0;
}