uva 1347
2015-08-07 15:45
337 查看
Tour
Submit Status
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 pi = < xi, yi > . 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 -coordinates.
Write a program that, given a set of n points in the plane, computes the shortest closed tour that connects the points according to John's strategy.
order of the x coordinate. White spaces can occur freely in input. The input data are correct.
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 and y coordinates. The second point,
for example, has the x coordinate 2, and the y coordinate 3. The result for each data set is the tour length, (6.47 for the first data set in the given example).
Sample
Sample
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 pi = < xi, yi > . 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 -coordinates.
Write a program that, given a set of n 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 ascendingorder of the x 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 and y coordinates. The second point,
for example, has the x coordinate 2, and the y 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
#include<cstdio> #include<cmath> #include<stdlib.h> #include<map> #include<set> #include<time.h> #include<vector> #include<queue> #include<string> #include<string.h> #include<iostream> #include<algorithm> using namespace std; #define eps 1e-8 #define PI acos(-1.0) #define INF 0x3f3f3f3f #define LL long long #define max(a,b) ((a)>(b)?(a):(b)) #define min(a,b) ((a)<(b)?(a):(b)) typedef pair<int , int> pii; #define maxn 1000 + 10 struct point { int x, y; }P[maxn]; int n; double d[maxn][maxn]; double dist(point a, point b) { return sqrt((double)(a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y)); } int main() { while(~scanf("%d", &n)) { for(int i = 0; i <= n; i++) for(int j = 0; j <= n; j++) d[i][j] = 1e18; for(int i = 1; i <= n; i++) scanf("%d%d", &P[i].x, &P[i].y); d [n-1] = dist(P , P[n-1]); for(int i = n - 1; i >= 2; i--) for(int j = 1; j < i; j++) { d[i][j] = min(d[i+1][j]+dist(P[i], P[i+1]), d[i+1][i]+dist(P[i+1], P[j])); } printf("%.2lf\n", d[2][1] + dist(P[1], P[2])); } return 0; }
相关文章推荐
- EditText输入格式设置
- 十一. 如果没有这个4扫盲项目,不要试图在初创公司
- Android 开发环境下载连接
- DOM中的创建,插入,删除
- 避免内存泄露的一些简单方法
- CSS之font-smoothing
- swift 代码加载xib storyboard
- Maven使用私服setting.xml中的配置
- Android初学习 - 在Java code(布局容器)中动态添加控件
- Field 'id' doesn't have a default value
- LoadRunner脚本 《第二篇》
- win10正式版分享的文件怎么取消共享?
- DAVE SDK 4.1.2 Help content —— 如何在父APP中建立多个APP
- Spark RDD API详解(一) Map和Reduce
- bp神经网络及matlab实现
- poj2299树状数组解法(转发备忘)
- 关于unity shader的StencilBuffer
- java基础---枚举(enum)
- Json读写本地文件实现代码
- arm开发板连接终端( xshell )