ZOJ 2581 Tour
来源:互联网 发布:厦门瑶池集庆骗局知乎 编辑:程序博客网 时间:2024/04/29 08:00
John Doe, a skilled pilot, enjoys traveling. While on vacation,he rents a small plane and starts visiting beautiful places. Tosave money, John must determine the shortest closed tour thatconnects his destinations. Each destination is represented by apoint in the plane pi = . John uses the following strategy: hestarts from the leftmost point, then he goes strictly left to rightto the rightmost point, and then he goes strictly right back to thestarting point. It is known that the points have distinctx-coordinates.
Write a program that, given a set of n points in the plane,computes the shortest closed tour that connects the oints accordingto John's strategy.
Input
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 coordinate.White spaces can occur freely in input. The input data arecorrect.
Output
For each set of data, your program should print the result tothe standard output from the beginning of a line. The tour length,a floating-point number with two fractional digits, represents theresult. An input/output sample is in the table below. Here thereare two data sets. The first one contains 3 points specified bytheir x and y coordinates. The second point, for example, has the xcoordinate 2, and the y coordinate 3. The result for each data setis the tour length, (6.47 for the first data set in the givenexample).
Sample Input
3
1 1
2 3
3 1
4
1 1
2 3
3 1
4 2
Sample Output
6.47
7.89
Source: Southeastern Europe 2005
源码:
解题报告:
首先需理解题意:从最左边一个点一直走到最右边一个点且严格按照从左到右的顺序,再从最右一个点一直走到最最左一个点且严格按照从右到左的顺序。
这是一个欧几里得旅行商问题,
dp[i][j]
建立递推关系:
最后再从j中挑出一个最大的连接j和n
- ZOJ 2581 Tour
- zoj 2750 dijkstra()
- zoj 2736 //巨水
- zoj 2773 //累加
- ZOJ 1037 Gridland
- zoj 1005 Jugs
- zoj 1016 Parencoding
- ZOJ 1014 Operand
- ZOJ 1012 Mainframe
- ZOJ 1010 Area
- zoj 1009 enigma
- zoj 1011 NTA
- ACM: zoj 2714
- ZOJ 2536 best balance
- ZOJ 3197 Goole Book
- ZOJ 1078 Palindrom Numbers
- ZOJ 1633 big string
- ZOJ 2239 In Danger
- 第五届蓝桥杯决赛做题报告
- 基本的高精度算法
- 黑马程序员_内省
- C++ STL 速成
- 2014-08-11 日志
- ZOJ 2581 Tour
- ZOJ 2536 best balance
- mysql 数据库日志分析
- ZOJ 3197 Goole Book
- 第八章 定制new和delete
- ZOJ 1078 Palindrom Numbers
- hdu 统计难题(1251)
- ZOJ 1633 big string
- ZOJ 2239 In Danger