zoukankan      html  css  js  c++  java
  • hdu1102 Constructing Roads 【最小生成树】【prime】

    Constructing Roads

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 24721    Accepted Submission(s): 9528


    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
     
    题意:n个城镇全部连通所需的最小权值,已给出m条路表示已连通。
    思路:prime算法的复习。
     
     

    #include<stdio.h> #include<string.h> #define inf 0x3f3f3f3f #define N 110 int book[N],e[N][N],dis[N]; int main() { int n,min,i,j,u,v,m,sum; while(scanf("%d",&n)!=EOF) { for(i = 1; i <= n; i ++) for(j = 1; j <= n; j ++) { scanf("%d",&e[i][j]); } scanf("%d",&m); for(i = 1; i <= m; i ++) { scanf("%d%d",&u,&v); e[u][v] = e[v][u] = 0; } memset(book,0,sizeof(book)); for(i = 1; i <= n; i ++) dis[i] = e[i][1]; sum = 0; book[1] = 1; for(i = 1; i < n; i ++) { min = inf; for(j = 1; j <= n; j ++) { if(!book[j]&&dis[j] < min) { min = dis[j]; u = j; } } book[u] = 1; sum += min; for(j = 1; j <= n; j ++) { if(!book[j]&&dis[j] > e[u][j]) dis[j] = e[u][j]; } } printf("%d ",sum); } return 0; }

     

  • 相关阅读:
    php遍历目录
    PHP处理一个5G文件,使用内存512M的,数据为整形,从大到小排序,优化排序算法
    百钱买百鸡问题 php版本
    青蛙跳100级台阶算法,完整可运行,php版本
    网站如何整体换角度
    SOA架构设计(转发)
    一些稍微复杂点的sql语句
    php变量和数组大小限制
    uploadify中文开发文档,解决php多图上传
    mysql索引的一些知识
  • 原文地址:https://www.cnblogs.com/hellocheng/p/7755620.html
Copyright © 2011-2022 走看看