zoukankan      html  css  js  c++  java
  • hdu1102:Constructing Roads(最小生成树)

    http://acm.hdu.edu.cn/showproblem.php?pid=1102

    Problem Description

    There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.

    We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.

    Input

    The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j.

    Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.

    Output

    You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.

    Sample Input

    3
    0 990 692
    990 0 179
    692 179 0
    1
    1 2

    Sample Output

    179

    题意分析:

    给出所有村庄之间的道路修建费用,有点路已经修建,求连接所有村庄需要最少的花费。

    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    using namespace std;
    #define N 120
    int e[N][N], book[N], dis[N];
    int main()
    {
    	int n, i, j, t, sum, u, v, mini, count, inf=99999999;
    	while(scanf("%d", &n)!=EOF)
    	{
    		for(i=1; i<=n; i++)
    			for(j=1; j<=n; j++)
    				scanf("%d", &e[i][j]);
    		memset(book, 0, sizeof(book));
    		scanf("%d", &t);	
    		while(t--)
    		{
    			scanf("%d%d", &u, &v);
    			e[u][v]=e[v][u]=0;
    		}
    		sum=0;
    		for(i=1; i<=n; i++)
    			dis[i]=e[1][i];
    		
    		book[1]=1;
    		count=1;
    		while(count<n)
    		{
    			mini=inf;
    			for(i=1; i<=n; i++)
    			{
    				if(dis[i]<mini && book[i]==0)
    				{
    					mini=dis[i];
    					u=i;
    				}
    			}
    			sum+=dis[u];
    			book[u]=1;
    			count++;
    			for(v=1; v<=n; v++)
    			{
    				if(dis[v]>e[u][v] && book[v]==0)	
    					dis[v]=e[u][v];
    			}
    		}
    		printf("%d
    ", sum);
    	}
    	return 0;
    }
  • 相关阅读:
    元组-琢磨已久的购物车程序
    学习使我充实自己-列表具备的功能
    很高兴今天用PYTHON3写了三级菜单程序!
    python内建模块shlex将普通字符串编码成符合linux shell的字符串
    HTTPS能登陆,HTTP不行
    linux shell判断输入的是哪个不可见字符,例如^X(Ctrl-X)
    TI CC3200做ETSI EN 300 328 认证
    使用systemd-resolved的系统中DNS来源优先级
    systmed-timesyncd中NTP服务器地址来源优先级
    markdown的简单应用实例
  • 原文地址:https://www.cnblogs.com/zyq1758043090/p/11852662.html
Copyright © 2011-2022 走看看