uva 216

题意：求将所有点连起来的最短距离。。貌似用最小生成树会超时....用回溯减枝可以过,注意的是每次都要+16

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;

struct point
{
	int x,y;
}p[10];
int n;
int a[10],b[10];
double MIN ;
int vis[10];

double dis(point a,point b)
{
	return sqrt(pow((a.x-b.x),2) + pow((a.y-b.y),2)) ;
}

void dfs(int cnt,int x,double l)
{
	if (cnt == n -1)
	{
		if (MIN > l)
		{
			MIN = l;
			memcpy(b,a,sizeof(b));
		}
		return ;
	}
	if( l >= MIN )
		return ;
	for (int i = 0 ; i < n ; i++)
	{
		if ( !vis[i] )
		{
			vis[i] = 1;
			a[cnt+1] = i ;
			dfs(cnt+1,i,l+dis(p[x],p[i])+16);
			vis[i] = 0 ;
		}
	}
}

int main()
{
	int t = 1;
	while (scanf("%d",&n)!= EOF && n )
	{
		for (int i = 0 ; i < n ; i++)
			cin>>p[i].x>>p[i].y;
		MIN = 1<<30 ;
		for (int i = 0 ; i < n ; i++)   // 以每一个都作为起点
		{
			memset(vis,0,sizeof(vis));
			vis[i] = 1 ;
			a[0] = i ;
			dfs(0,i,0.0);
		}
		 cout<<"**********************************************************"<<endl;
		 cout<<"Network #"<<t<<endl;
		 t++;
		 for (int i = 1 ; i < n ; i++ )
		 {		 
			 double tmp=dis(p[b[i]],p[b[i-1]])+16;
			 printf("Cable requirement to connect (%d,%d) to (%d,%d) is %.2lf feet.\n",p[b[i-1]].x,p[b[i-1]].y,p[b[i]].x,p[b[i]].y,tmp);
		 }
		 printf("Number of feet of cable required is %.2lf.\n",MIN);
	}
	return 0 ;
}