O - 听说下面都是裸题（最小生成树模板题）

最新推荐文章于 2020-02-19 11:34:36 发布

weixin_30539625

最新推荐文章于 2020-02-19 11:34:36 发布

阅读量65

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Staceyacm/p/10784754.html

本文深入探讨了最小生成树算法的应用场景，特别是在解决道路照明优化问题中如何通过算法找到节省成本的最佳方案。通过实例讲解了如何使用最小生成树算法来确定在确保所有节点连接的情况下，最小化总边权的方法。

Economic times these days are tough, even in Byteland. To reduce the operating costs, the government of Byteland has decided to optimize the road lighting. Till now every road was illuminated all night long, which costs 1 Bytelandian Dollar per meter and day. To save money, they decided to no longer illuminate every road, but to switch off the road lighting of some streets. To make sure that the inhabitants of Byteland still feel safe, they want to optimize the lighting in such a way, that after darkening some streets at night, there will still be at least one illuminated path from every junction in Byteland to every other junction.

What is the maximum daily amount of money the government of Byteland can save, without making their inhabitants feel unsafe?

Input

The input file contains several test cases. Each test case starts with two numbers m and n, the number of junctions in Byteland and the number of roads in Byteland, respectively. Input is terminated by m=n=0. Otherwise, 1 ≤ m ≤ 200000 and m-1 ≤ n ≤ 200000. Then follow n integer triples x, y, z specifying that there will be a bidirectional road between x and y with length z meters (0 ≤ x, y < m and x ≠ y). The graph specified by each test case is connected. The total length of all roads in each test case is less than 2 31.

Output

For each test case print one line containing the maximum daily amount the government can save.
Sample Input

Sample Output

51
题解（一个求出修路总和减去最小的花费即可，最小生成树裸题）

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int pre[200005];
struct node{
    int x,y;
   int val;
}road[200005];
int find(int x)
{
    if(x==pre[x])
    return x;
    else
    {
        return pre[x]=find(pre[x]);
    }
}
bool merge (int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(fx!=fy)
    {
        pre[fx]=fy;
        return true;
    }
    else
    {
        return false;
    }
}
bool cmp(node x,node y)
{
    return x.val<y.val;
}
int main()
{
    int m,n;
    while(scanf("%d%d",&m,&n))
  {
         if(m==0&&n==0)
         {
             break; 
        } 
        for(int t=0;t<m;t++)
        {
            pre[t]=t;
        }
        long long int sum1=0;
        for(int t=0;t<n;t++)
        {
            scanf("%d%d%d",&road[t].x,&road[t].y,&road[t].val);
            sum1+=road[t].val;
            
        }
        sort(road,road+n,cmp);
        long long int sum=0;
        int cnt=0;
        for(int t=0;t<n;t++)
        {
            if(cnt==m-1)
            break;
            if(merge(road[t].x,road[t].y))
            {
            sum+=road[t].val;
            cnt++;
             }
        }
        if(cnt==m-1)
        {
            printf("%d\n",sum1-sum);
        }
    
  }
    return 0;
}

转载于:https://www.cnblogs.com/Staceyacm/p/10784754.html