B
来源:互联网 发布:淘宝怎么改名字啊 编辑:程序博客网 时间:2024/04/27 21:14
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.<br>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?<br>
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. <br><br>Input contains multiple test cases. Process to the end of file.<br>
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. <br>
Sample Input
31.0 1.02.0 2.02.0 4.0题目:给你几个点让你连起来且最短,最短路径问题;思路:prim算法#include<iostream>#include<stdio.h>#include<string.h>#include<cmath>const int INF=103;double G[INF][INF];int vis[INF];double low[INF];double res,n;using namespace std;struct Edge{ double x,y;} per[INF];double cacu(double x1,double y1,double x2,double y2){ return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}double prim(){ res=0; memset(vis,0,sizeof(vis)); vis[0]=1; for(int i=1; i<n; i++) low[i]=G[0][i]; for(int i=1; i<n; i++) { double MIN=0x1f1f1f1f; int loc; for(int j=0; j<n; j++) { if(!vis[j]&&MIN>low[j]) { MIN=low[j]; loc=j; } } res+=MIN; vis[loc]=1; for(int k=0; k<n; k++) { if(!vis[k]&&low[k]>G[loc][k]) { low[k]=G[loc][k]; } } } return res;}int main(){ while(cin>>n) { for(int i=0; i<n; i++) { cin>>per[i].x>>per[i].y; } for(int i=0; i<n; i++) { for(int j=0; j<n; j++) { G[i][j]=cacu(per[i].x,per[i].y,per[j].x,per[j].y); } } printf("%.2lf\n",prim()); } return 0;}
0 0
- b
- b
- b
- //b
- B
- b
- B
- B
- B
- B
- b
- B
- B
- B
- B
- B
- B
- b
- js---360旋转效果
- 函数指针基础的学习记录
- android开发之Seekbar
- 麒麟开源堡垒机内置SSL VPN使用指南
- Writing Modular JavaScript With AMD, CommonJS & ES Harmony
- B
- typedef struct和struct的用法
- script.fex 与 script.bin文件转换
- sql语句练习50题
- RapidJSON学习整理
- 加分二叉树[NOIP 2003提高组][Codevs 1090]
- caffe基础(8):draw_net.py绘制网络结构
- WINCC 7.2 中文版—真正的中文版
- HDU 4966 (最小树形图)