bzoj3892: [Usaco2014 Dec]Marathon

3892: [Usaco2014 Dec]Marathon

Time Limit: 10 Sec   Memory Limit: 128 MB
Submit: 221   Solved: 135
[ 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,f[i][j]表示走到i，用了j次跳转。

转移方程：f[i][j]=min(f[i][j],f[k][j-(i-k-1)]+abs(x[i]-x[k])+abs(y[i]-y[k]);

<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
#define inf 1e15
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
ll n,m,f[505][505],x[505],y[505];
int main()
{
    n=read();m=read();
    for(int i=1;i<=n;i++)x[i]=read(),y[i]=read();
    memset(f,127/3,sizeof(f));
    f[1][0]=0;
    for(int i=2;i<=n;i++)
      for(int j=0;j<=i-2,j<=m;j++)
        for(int k=i-1;i-k-1<=j,k;k--)
          f[i][j]=min(f[i][j],f[k][j-(i-k-1)]+abs(x[i]-x[k])+abs(y[i]-y[k]));
    ll ans=inf;
    for(int i=0;i<=m;i++)ans=min(ans,f[n][m]);
    cout<<ans<<endl;
}
</span>