UVA 1347 - Tour - ACM/ICPC SEERC 2005

#include<bits/stdc++.h>
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;i<n-1;i++)
			d[n-1][i]=dist(n-1,n)+dist(i,n);
		for(i=n-2;i>1;i--)
			for(j=1;j<i;j++)
				d[i][j]=min(d[i+1][j]+dist(i,i+1),d[i+1][i]+dist(i+1,j));
		printf("%.2lf\n",d[2][1]+dist(1,2));
	}
	return 0;
}