Eddy's picture+生成树+prime算法
来源:互联网 发布:手机淘宝卖家实名认证 编辑:程序博客网 时间:2024/05/17 02:18
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4827 Accepted Submission(s): 2397
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
Recommend
JGShining
思路:标准的生成树算法。
#include<iostream>#include<cmath>#include<cstdio>using namespace std;typedef struct infor {double x,y;}infor;double a[102][102];int n,vi[102];void prime(int x){double sum=0;int k=0;k++;vi[x]=1;int mark,i;while(k!=n){double min1=10000000;for(i=0;i<n;i++){if(vi[i]){for(int j=0;j<n;j++)if(min1>a[i][j]&&!vi[j]){min1=a[i][j];mark=j;}}}sum+=min1;k++;vi[mark]=1;}printf("%.2lf\n",sum);}int main(){while(cin>>n){int i,j;infor s[102];memset(vi,0,sizeof(vi));for(i=0;i<n;i++)cin>>s[i].x>>s[i].y;for(i=0;i<n;i++)for(j=0;j<n;j++)a[j][i]=a[i][j]=sqrt((s[i].x-s[j].x)*(s[i].x-s[j].x)+(s[i].y-s[j].y)*(s[i].y-s[j].y));prime(0);}return 0;}
- Eddy's picture+生成树+prime算法
- HDU 1162 Eddy's picture【最小生成树,Prime算法+Kruskal算法】
- Eddy's picture + prime算法 + kruskal算法
- hdu 1162Eddy's picture Prime算法求最小生成树
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- hdu1162 Eddy's picture (最小生成树之prim 算法)
- HDOJ 1162 Eddy's picture(最小生成树prim算法)
- HDU1162-Eddy's picture-最小生成树(prim算法模板)
- hdu 1162 Eddy's picture(最小生成树算法)
- HDU 1162 Eddy's picture (prime算法_裸题)
- Eddy's picture(最小生成树)
- HDU1162 Eddy's picture 最小生成树
- hdu 1162 Eddy's picture<java><prime>
- hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)
- hdu 1162 Eddy's picture 最小生成树入门题 Prim+Kruskal两种算法AC
- hdu 1162 Eddy's picture(最小生成树之kruskal算法)
- HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
- hdu 1162 Eddy's picture(最小生成树Kruskal)
- 按位异或运算^
- Lua脚本在C++下的舞步(三)
- H.264起始码
- Android获取图片资源之——拍照后在程序中显示照片
- 动态链表
- Eddy's picture+生成树+prime算法
- Java中Date类和Calender类的比较_IT168文库
- 【Linux学习笔记】栈与函数调用惯例—下篇
- UVa 10003 - Cutting Sticks 区间dp
- Servlet调用过程和生命周期
- C语言位运算详解
- android开发:按钮事件
- SimpleDateFormat使用详解
- Web缓存系列之webapp缓存思路