3892: [Usaco2014 Dec]Marathon

3892: [Usaco2014 Dec]Marathon

Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 169  Solved: 100
[Submit][Status][Discuss]

Description

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 N checkpoints (3 <= N <= 500) to be visited in sequence, where checkpoint 1 is the starting location and checkpoint N 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 K checkpoints (K < N) in order to shorten her total journey. She cannot skip checkpoints 1 or N, 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 K checkpoints. Since the course is set in a downtown area with a grid of streets, the distance between two checkpoints at locations (x1, y1) and (x2, y2) is given by |x1-x2| + |y1-y2|.

在二维平面上有N个点，从(x1,y1)到(x2,y2)的代价为|x1-x2|+|y1-y2|。

求从1号点出发，按从1到N的顺序依次到达每个点的最小总代价。

你有K次机会可以跳过某个点，不允许跳过1号点或N号点。

 

 

Input

The first line gives the values of N and K. The next N lines each contain two space-separated integers, x and y, representing a checkpoint (-1000 <= x <= 1000, -1000 <= y <= 1000). 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

Output the minimum distance that Bessie can run by skipping up to K checkpoints. In the sample case shown here, skipping the checkpoints at (8, 3) and (10, -5) leads to the minimum total distance of 4.

 

Sample Input

5 2
0 0
8 3
1 1
10 -5
2 2

Sample Output

4

HINT

 

Source

Silver

 

题解：一道神奇的DP，b[i,j]代表从1到i，共计跳跃了j次不难得出递推式

$b[i,j]=min(b[i-k-1,j-k]+dis(i-k-1,i))$

,然后$O\left(N{M}^{2} \right)$瞎搞万事

/**************************************************************
    Problem: 3892
    User: HansBug
    Language: Pascal
    Result: Accepted
    Time:808 ms
    Memory:4148 kb
****************************************************************/
 
var
   i,j,k,l,m,n:longint;
   a:array[0..1000,1..2] of longint;
   b:array[0..1000,0..1000] of longint;
function dis(x,y:longint):longint;inline;
         begin
              exit(abs(a[x,1]-a[y,1])+abs(a[x,2]-a[y,2]));
         end;
function min(x,y:longint):longint;inline;
         begin
              if x<y then min:=x else min:=y;
         end;
begin
     readln(n,m);
     for i:=1 to n do readln(a[i,1],a[i,2]);
     fillchar(b,sizeof(b),-1);
     b[1,0]:=0;
     for i:=2 to n do
         begin
              for j:=0 to min(i-2,m) do
                    begin
                         b[i,j]:=maxlongint;
                         for k:=0 to j do
                             if b[i-k-1,j-k]<>-1 then
                                begin
                                     b[i,j]:=min(b[i,j],b[i-k-1,j-k]+dis(i-k-1,i));
                                end;
                    end;
         end;
     writeln(b[n,min(n-2,m)]);
end.