hdu 1162 Eddy's picture(最小生成树算法)
2014-08-23 19:26
316 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1162
[align=left]Problem Description[/align]
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?
[align=left]Input[/align]
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.
[align=left]Output[/align]
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.
[align=left]Sample Input[/align]
3
1.0 1.0
2.0 2.0
2.0 4.0
[align=left]Sample Output[/align]
3.41
题目大意:用最短的线段,使所有的点连通。也就是最短路的一种应用,不多说,prim就可以解决了~~特别注意是输入多组数据的,否则会wa的!!!
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6866 Accepted Submission(s): 3469[align=left]Problem Description[/align]
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?
[align=left]Input[/align]
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.
[align=left]Output[/align]
Your program prints a single real number to two decimal places: the minimum total length of ink lines that can connect all the points.
[align=left]Sample Input[/align]
3
1.0 1.0
2.0 2.0
2.0 4.0
[align=left]Sample Output[/align]
3.41
题目大意:用最短的线段,使所有的点连通。也就是最短路的一种应用,不多说,prim就可以解决了~~特别注意是输入多组数据的,否则会wa的!!!
#include <iostream> #include <cstdio> #include <cmath> using namespace std; double node[110],map[110][110],Min,n; const double INF=999999999; double prim() { int vis[110]= {0}; int tm=1,m; double sum=0; vis[tm]=1; node[tm]=0; for (int k=2; k<=n; k++) { Min=INF; for (int i=1; i<=n; i++) if (!vis[i]) { if (node[i]>map[tm][i]) node[i]=map[tm][i]; if (Min>node[i]) { Min=node[i]; m=i; } } vis[m]=1; tm=m; sum+=node[m]; } //for (int i=1; i<=n; i++) //sum+=node[i]; return sum; } int main () { double a[110],b[110]; while (cin>>n) { for (int i=1; i<=n; i++) cin>>a[i]>>b[i]; for (int i=1; i<=n; i++) { node[i]=INF; for (int j=1; j<=n; j++) map[i][j]=INF; } for (int i=1; i<=n; i++) { for (int j=1; j<=n; j++) { map[i][j]=map[j][i]=sqrt((a[i]-a[j])*(a[i]-a[j])+(b[i]-b[j])*(b[i]-b[j])); } } printf ("%.2lf\n",prim()); } return 0; }
相关文章推荐
- HDU1162-Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(最小生成树算法)
- HDU-1875 畅通工程再续-1162 - Eddy's picture(最小生成树,Kruskal 算法实现 )
- hdu 1162 Eddy's picture (最小生成树)
- HDU 1162 Eddy's picture (最小生成树)(java版)
- hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)
- HDU 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(最小生成树之kruskal算法)
- hdu1162 Eddy's picture (最小生成树之prim 算法)
- HDU 1162 Eddy's picture (Kruscal最小生成树)
- hdu 1162 Eddy's picture(最小生成树)
- HDOJ-1162 Eddy's picture(最小生成树)
- HDU 1162 Eddy's picture (最小生成树)
- hdu 1162 Eddy's picture(最小生成树Prim算法)
- HDU 1162 Eddy's picture(最小生成树)
- HDU 1162.Eddy's picture【最小生成树(Kruskal算法)】【5月30】
- hdu 1162 Eddy's picture (Kruskal算法,prim算法,最小生成树)
- ACM HDU 1162 Eddy's picture (简单最小生成树,开始练习使用模板了)
- HDUOJ-----(1162)Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(最小生成树prim)