勇气的挑战.docVIP

勇气的挑战 Problem 给定n个点的坐标(x,y,z),且n=50,从点1出发,怎么样才能走一条路径,访问每个点一次且仅一次,使走过的距离和最小? Input 多组数据. 第1行n,然后n行3个整数坐标 Output 每组一行,代表最小权和 Sample Input 3 0 0 0 1 1 0 1 -1 0 Sample Output 3.4 Source A Great Beloved and My Gate to Freedom 来源：/showproblem.php?problem_id=1073 最新评论发表评论 您尚未登录本站，不能发表评论，请登录 或者 注册 成为本站会员 评论人: wolailelxy??发布时间: 2013-4-10 23:06:04 #includeiostream #includecmath using?namespace?std; struct?ZB {int?x,y,z; }; double?L(ZB?a,ZB?b) {return?sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)+(a.z-b.z)*(a.z-b.z)); } double?L(ZB?*p,int?n) {int?q;ZB?t;double?d=0; for(int?i=0;in-1;i++) { q=i+1; for(int?j=i+1;jn;j++) {if(L(p[i],p[q])L(p[i],p[j])) q=j;} t=p[i+1];p[i+1]=p[q];p[q]=t; } for(int?i=0;in-1;i++) d+=L(p[i],p[i+1]); return?d; } int?main() {ZB?*p; int?n; double?MD; cout输入坐标个数：n=; cinn; p=new?ZB[n]; cout请输入坐标x?y?z：endl; for(int?i=0;in;i++) ????cinp[i].xp[i].yp[i].z; MD=L(p,n); cout最小距离为：MDendl; system(pause); return?0; } 评论人: 宝贝赢赢??发布时间: 2012-3-7 23:55:14 public?class?test_8 ????{ ????????private?double?mindt; ????????class?point ????????{ ????????????public?int?x,?y,?z; ????????} ????????int?n; ????????point[]?p; ????????public?double?Mindt ????????{ ????????????get ????????????{ ????????????????return?mindt; ????????????} ????????} ???? ????????public?test_8(int?n,int[,]tp) ????????{ ????????????this.n=n; ????????????p=new?point[n]; ????????????for?(int?j?=?0;?j??n;?j++) ????????????{ ????????????????p[j]?=?new?point(); ????????????????p[j].x?=?tp[j,?0]; ????????????????p[j].y?=?tp[j,?1]; ????????????????p[j].z?=?tp[j,?2]; ????????????} ????????????mindt?=?0; ????????????mean(); ????????} ????????public?test_8(string?input,string?output) ????????{ ????????????FileStream?fs=new?FileStream(input,FileMode.Open,FileAccess.Read); ????????????StreamReader?sr?=?new?StreamReader(fs); ????????????FileStream?fo?=?new?FileStream(output,?FileMode.Append,?FileAccess.Write); ????????????StreamWriter?sw?=?new?StreamWriter(fo); ????????????sw.WriteLine(\n原始数据如下所示：\n); ????????????st