UVA 1347 - Tour - ACM/ICPC SEERC 2005

#include
using namespace std;
const int m=1010;
int n,i,j,a[m],b[m];
double d[m][m];
double dist(int x,int y){
	return sqrt((a[x]-a[y])*(a[x]-a[y])+(b[x]-b[y])*(b[x]-b[y]));
}
int main(){
	while(scanf("%d",&n)!=EOF){
		for(i=1;i<=n;i++)
			scanf("%d%d",&a[i],&b[i]);
		for(i=1;i1;i--)
			for(j=1;j

你可能感兴趣的:(动态规划)