hdu 1162 Eddy's picture(最小生成树prim)
来源:互联网 发布:淘宝上货怎么上 编辑:程序博客网 时间:2024/05/18 06:24
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7530 Accepted Submission(s): 3824
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
Author
eddy
题目分析:
最小生成树模板题
最小生成树模板题
#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <cmath>#define MAX 107#define INF 1e8using namespace std;int n;double mp[MAX][MAX];bool used[MAX];double cost[MAX];struct Point{ double x,y;}p[MAX];double prim ( ){ double ret = 0 , minn ; int pos=1, pre; for ( int i = 1 ; i <= n ; i++ ) cost[i] = INF; memset ( used , false , sizeof ( used )); for ( int i = 1 ; i < n ; i++ ) { pre = pos; minn = INF; used[pos] = true; for ( int j = 1 ; j <= n ; j++ ) if ( !used[j] && pre != j ) { cost[j] = min ( cost[j] , mp[pre][j] ); if ( cost[j] < minn ) minn = cost[j] , pos = j; } ret += minn; } return ret;}int main ( ){ while ( ~scanf ( "%d" , &n ) ) { for ( int i = 1 ; i <= n ; i++ ) scanf ( "%lf%lf" , &p[i].x , &p[i].y ); for ( int i = 1 ; i <= n ; i++ ) for ( int j = 1 ; j <= n ; j++ ) mp[i][j] = sqrt( pow ( p[i].x - p[j].x , 2.0 ) + pow ( p[i].y - p[j].y , 2.0 )); printf ( "%.2lf\n" , prim ()); }}
0 0
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- hdu 1162 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
- hdoj 1162 Eddy's picture【最小生成树 kruskal && prim】
- hdu 1162 Eddy's picture 最小生成树入门题 Prim+Kruskal两种算法AC
- hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)
- hdu 1162 Eddy's picture(最小生成树Kruskal)
- HDU 1162 Eddy's picture 最小生成树
- hdu 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(基础最小生成树)
- HDU 1162 Eddy's picture(最小生成树)
- HDU 1162 Eddy's picture 最小生成树
- HDU 1162 Eddy's picture(图论-最小生成树)
- Hdu 1162 Eddy's picture【最小生成树】
- HDU-1162 Eddy's picture(最小生成树[Kruskal])
- 使用scikit-learn做线性回归
- Linux下gtest的安装与使用
- Java 动态代理
- SuperMap iObjects C++结合Qt在vs2012上的开发环境搭建
- 计算机组成第一次互评作业:MIPS汇编程序设计
- hdu 1162 Eddy's picture(最小生成树prim)
- eclipse构建maven的web项目
- android 中获取当前设备安装了哪些应用
- Java 注解 Annotation
- 《Thinking in Java》读书笔记之并发(三)
- 数据仓库——概念数据模型
- 允许重复数字的划分树
- 蓝桥杯 结果填空 奇怪的比赛 dfs
- View 绘制流程