bzoj#P3892. [Usaco2014 Dec]Marathon
[Usaco2014 Dec]Marathon
题目描述
Unhappy with the poor health of his cows, Farmer John enrolls them in an assortment of different physical fitness activities. His prize cow Bessie is enrolled in a running class, where she is eventually expected to run a marathon through the downtown area of the city near Farmer John's farm! The marathon course consists of checkpoints to be visited in sequence, where checkpoint is the starting location and checkpoint is the finish. Bessie is supposed to visit all of these checkpoints one by one, but being the lazy cow she is, she decides that she will skip up to checkpoints in order to shorten her total journey. She cannot skip checkpoints or , however, since that would be too noticeable. Please help Bessie find the minimum distance that she has to run if she can skip up to checkpoints. Since the course is set in a downtown area with a grid of streets, the distance between two checkpoints at locations and is given by .
在二维平面上有 个点,从 到 的代价为 。
求从 号点出发,按从 到 的顺序依次到达每个点的最小总代价。
你有 次机会可以跳过某个点,不允许跳过 号点或 号点。
输入格式
The first line gives the values of and . The next lines each contain two space-separated integers, and , representing a checkpoint. The checkpoints are given in the order that they must be visited. Note that the course might cross over itself several times, with several checkpoints occurring at the same physical location. When Bessie skips such a checkpoint, she only skips one instance of the checkpoint -- she does not skip every checkpoint occurring at the same location.
输出格式
Output the minimum distance that Bessie can run by skipping up to checkpoints.
5 2
0 0
8 3
1 1
10 -5
2 2
4
样例说明
In the sample case shown here, skipping the checkpoints at and leads to the minimum total distance of .
数据规模与约定
对于 的数据,,,。
题目来源
Silver