UVa 1347 Tour

Tour

Time Limit: 3000MS

Memory Limit: Unknown

64bit IO Format: %lld & %llu

Description

 

John Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed tour that connects his destinations. Each destination is represented by a point in the plane p_i = < x_i, y_i ><tex2html_verbatim_mark> . John uses the following strategy: he starts from the leftmost point, then he goes strictly left to right to the rightmost point, and then he goes strictly right back to the starting point. It is known that the points have distinct x<tex2html_verbatim_mark> -coordinates.

Write a program that, given a set of n<tex2html_verbatim_mark> points in the plane, computes the shortest closed tour that connects the points according to John's strategy.

Input

The program input is from a text file. Each data set in the file stands for a particular set of points. For each set of points the data set contains the number of points, and the point coordinates in ascending order of the x<tex2html_verbatim_mark> coordinate. White spaces can occur freely in input. The input data are correct.

Output

For each set of data, your program should print the result to the standard output from the beginning of a line. The tour length, a floating-point number with two fractional digits, represents the result.

Note: An input/output sample is in the table below. Here there are two data sets. The first one contains 3 points specified by their x<tex2html_verbatim_mark> and y<tex2html_verbatim_mark>coordinates. The second point, for example, has the x<tex2html_verbatim_mark> coordinate 2, and the y<tex2html_verbatim_mark> coordinate 3. The result for each data set is the tour length, (6.47 for the first data set in the given example).

Sample Input

3
1 1
2 3
3 1
4
1 1
2 3
3 1
4 2

Sample Output

6.47
7.89

可以把一个人的往返看作是两个人从起点同时出发走到终点，两人走到的点不重复

则对于一个点，要么一个人过去，要么另一个人过去（不需要区分到底是哪个人）

 /*by SilverN*/
 #include<iostream>
 #include<algorithm>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 const int mxn=;
 int x[mxn],y[mxn];
 double mp[mxn][mxn];
 double f[mxn][mxn];
 int n;
 int main(){
     while(scanf("%d",&n)!=EOF){
         memset(f,,sizeof(f));
         int i,j;
         for(i=;i<=n;i++){
             scanf("%d%d",&x[i],&y[i]);
         }
         for(i=;i<=n;i++){
             for(j=;j<=n;j++){
                 mp[i][j]=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
             }
         }
         for(i=n-;i>=;i--){//i倒推
             for(j=;j<i;j++){
                 if(i==n-)f[i][j]=mp[i][n]+mp[j][n];//边界
                 else f[i][j]=min(mp[i][i+]+f[i+][j],mp[j][i+]+f[i+][i]);
             }
         }
         printf("%.2f\n",mp[][]+f[][]);
         //最终状态是一个人走到了点2，一个人走到了点1，需要再加上从2到1的距离
     }
     return ;
 }