hdu1162——初学最小生成树
2011-10-26 21:43
218 查看
Eddy's picture
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2831 Accepted Submission(s): 1375
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
Sample Output
3.41
分析:
囧,又是初学。。。。
马上noip了,我发现什么东西都是初学啊。。。。。
人家在复习,我在预习。。。。囧
真悲催。
这个最小生成树也比较裸了。。。。
上代码
prim:
program hdu_1162; var i,j,n,m,k,l:longint; ans,max:real; x,y,d:array[1..100]of real; a:array[1..100,1..100]of real; begin assign(input,'hdu.in'); reset(input); while not eof do begin fillchar(a,sizeof(a),10); fillchar(d,sizeof(d),10); ans:=0; readln(n); for i:=1 to n do readln(x[i],y[i]); for i:=1 to n do for j:=1 to n do begin a[i,j]:=sqrt(sqr(x[i]-x[j])+sqr(y[i]-y[j])); a[j,i]:=a[i,j]; end; for i:=1 to n do d[i]:=a[1,i]; d[1]:=0; for i:=1 to n-1 do begin max:=maxlongint; for j:=1 to n do if (d[j]>0)and(d[j]<max) then begin max:=d[j]; k:=j; end; ans:=ans+max; for j:=1 to n do if d[j]>a[k,j] then d[j]:=a[k,j]; end; writeln(ans:0:2); end; close(input); end.
相关文章推荐
- HDU 1162 Eddy's picture(最小生成树-Prim)
- HDU 1162 Eddy's picture【最小生成树,Prime算法+Kruskal算法】
- hdu 1162 Eddy's picture 基础最小生成树★
- hdu 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(最小生成树,prim)
- hdu 1162 Eddy's picture(最小生成树之kruskal算法)
- hdu1162最小生成树
- HDU-1875 畅通工程再续-1162 - Eddy's picture(最小生成树,Kruskal 算法实现 )
- HDU 1162 Eddy's picture (最小生成树)(java版)
- hdu 1162 Eddy's picture(最小生成树prim)
- hdu 1162 最小生成树
- HDU 1162 Eddy's picture 最小生成树
- HDU 1162 Eddy's picture(最小生成树)
- hdu 1162 Eddy's picture(最小生成树算法)
- hdu 1162 Eddy's picture(最小生成树Kruskal)
- hdu 1162(最小生成树)
- hdu1162 Eddy's picture(图论:最小生成树-minimal spanning tree)
- HDU 1162 Eddy's picture(点连通:最小生成树)
- hdu 1162 最小生成树(Kruskal)
- hdu 1162 Eddy's picture(最小生成树算法)