HDU1162 Eddy's picture 【最小生成树Prim】
来源:互联网 发布:nativeshare.js下载 编辑:程序博客网 时间:2024/05/22 02:03
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6723 Accepted Submission(s): 3391
Problem Description
Eddy begins to like painting pictures recently ,he is sure of himself to become a painter.Every day Eddy draws pictures in his small room, and he usually puts out his newest pictures to let his friends appreciate. but the result it can be imagined, the friends are not interested in his picture.Eddy feels very puzzled,in order to change all friends 's view to his technical of painting pictures ,so Eddy creates a problem for the his friends of you.
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
Problem descriptions as follows: Given you some coordinates pionts on a drawing paper, every point links with the ink with the straight line, causes all points finally to link in the same place. How many distants does your duty discover the shortest length which the ink draws?
Input
The first line contains 0 < n <= 100, the number of point. For each point, a line follows; each following line contains two real numbers indicating the (x,y) coordinates of the point.
Input contains multiple test cases. Process to the end of file.
Input contains multiple test cases. Process to the end of file.
Output
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.
Sample Input
31.0 1.02.0 2.02.0 4.0
Sample Output
3.41
题意:给定n个点的坐标,求将这n个点连起来的最小生成树。
题解:直接套模板。
#include <stdio.h>#include <math.h>#include <string.h>#define maxn 102double _x[maxn], _y[maxn];double map[maxn][maxn];bool vis[maxn];double cal(int i, int j){double x = _x[i] - _x[j];double y = _y[i] - _y[j];return sqrt(x * x + y * y);}void Prim(int n){int i, j, count = 0, u;double len = 0, tmp;vis[0] = 1;while(count < n - 1){for(i = 0, tmp = -1; i < n; ++i){if(!vis[i]) continue;for(j = 0; j < n; ++j)if(!vis[j] && (map[i][j] < tmp || tmp < 0)){tmp = map[i][j]; u = j;}}if(tmp >= 0){++count; vis[u] = 1;len += tmp;}}printf("%.2lf\n", len);}int main(){//freopen("in.txt", "r", stdin);//freopen("out.txt", "w", stdout);int n, i, j;double len;while(scanf("%d", &n) != EOF){memset(vis, 0, sizeof(vis));for(i = 0; i < n; ++i){scanf("%lf%lf", _x + i, _y + i);for(j = 0; j < i; ++j){len = cal(i, j);map[i][j] = map[j][i] = len;}}Prim(n);}return 0;}
0 0
- hdu1162 Eddy's picture (prim最小生成树)
- hdu1162 Eddy's picture (最小生成树之prim 算法)
- HDU1162 Eddy's picture 【最小生成树Prim】
- HDU1162-Eddy's picture-最小生成树(prim算法模板)
- hdu1162 Eddy's picture 最小生成树 prim
- HDU1162 Eddy's picture 最小生成树
- hdu1162 Eddy's picture 并查集+最小生成树
- HDU1162 Eddy's picture【Prim】
- hdu1162 Eddy's picture(prim模板)
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- hdu 1162 Eddy's picture(最小生成树prim)
- HDOJ 1162 Eddy's picture(最小生成树prim算法)
- HDOJ 1162 Eddy's picture 最小生成树 Kruscal && Prim
- HDU 1162 Eddy's picture(最小生成树-Prim)
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- hdu 1162 Eddy's picture(最小生成树,prim)
- hdu1162 Eddy's picture(图论:最小生成树-minimal spanning tree)
- hdu1162(并查集+Kruskal最小生成树)-- Eddy's picture
- sendRedirect&forword的区别
- linux c 下获取文件大小
- Android Shell命令dumpsys
- hdoj.1283 最简单的计算机 20140724
- sendRedirect&forword的区别2
- HDU1162 Eddy's picture 【最小生成树Prim】
- X86和ARM:函数调用参数传递和返回值
- webservice应用举例
- binder的机制和原理
- 一元三次方程求解
- bluedroid 协议 学习
- poj 1258 Agri-Net (最小生成树 prim)
- 多线程和多进程的区别(小结)
- Android ActionBar完全解析,使用官方推荐的最佳导航栏(下)