bzoj3892

分析：我还是年轻、、以为贪心能过，实际上还是得dp。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
int n,k;
const int N=1e5+5;
typedef long long ll;
struct node
{
    int x,y,z,l,r;
}a[N];
int f[1005][1005];
const int inf=1e9;
inline int cal(int i,int j)
{
    return abs(a[i].x-a[j].x)+abs(a[i].y-a[j].y);
}
int main()
{
    scanf("%d%d",&n,&k);
    fo(i,1,n)scanf("%d%d",&a[i].x,&a[i].y);
    memset(f,0,sizeof(f));
    fo(i,2,n)
    fo(j,0,min(i-1,k))
    {
        f[i][j]=inf;
        fo(k,0,j)
        f[i][j]=min(f[i][j],f[i-k-1][j-k]+cal(i-k-1,i));
    }
    printf("%d\n",f[n][k]);
    return 0;
}