首页 / 算法 / HDU 1162 Eddy's picture （prime算法_裸题）

HDU 1162 Eddy's picture （prime算法_裸题）

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了HDU 1162 Eddy's picture （prime算法_裸题），小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含2316字，纯文字阅读大概需要4分钟。

内容图文

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?
 

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.
 

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
            
3
1.0 1.0
2.0 2.0
2.0 4.0
 


最小生产树，裸题—----------.---------------

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
double lowcost[11111];
double map[111][111];
const double inf=99999999;
int vis[111];
struct node
{
	double x;
	double y;
}a[11111];

double fun(node x,node y)
{
	return sqrt((x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y));
}

int main()
{
	int n,i,j,k;
	double sum,temp,max;
	while(scanf("%d",&n)!=EOF){
		for(i=1;i<=n;i++) {
			scanf("%lf%lf",&a[i].x,&a[i].y);
			vis[i]=0;
		}
		 for(i=1;i<=n;i++) {
		 	for(j=i+1;j<=n;j++){
		 		map[i][j]=map[j][i]=fun(a[i],a[j]);
			 }
		 }
		 vis[1]=1;
		 sum=0;
		 for(i=1;i<=n;i++) lowcost[i]=map[1][i];
		 for(i=1;i<=n;i++) {
		 	temp=inf;
		 	for(j=1;j<=n;j++) {
		 		if(!vis[j] && lowcost[j]<temp) {
		 			k=j;
		 			temp=lowcost[j];
				 }
			 }
			 if(temp==inf) break;
			 vis[k]=1;
			 sum+=temp;
			 for(j=1;j<=n;j++) {
			 	if(!vis[j] && lowcost[j]>map[k][j]) lowcost[j]=map[k][j];
			 }
		 }
		 printf("%0.2lf\n",sum);
	}
	return 0;
	
}


版权声明：本文为博主原创文章，未经博主允许不得转载。

（prime算法_裸题）' ref='nofollow'>HDU 1162 Eddy's picture （prime算法_裸题）

原文：http://blog.csdn.net/h1021456873/article/details/47727265

内容总结

以上是互联网集市为您收集整理的HDU 1162 Eddy's picture （prime算法_裸题）全部内容，希望文章能够帮你解决HDU 1162 Eddy's picture （prime算法_裸题）所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端

扫描二维码推送至手机访问。

本文链接：https://qyyshop.com/info/1245498.html

来源：【匿名】