传送门
题解:
画图(画四个点)观察可知通过k点连接i,j两点的代价为x[k+1]-x[i]+y[k]-y[j]。
设dp[i][j]表示将i,j两点相连的最小代价。
可得转移方程:dp[i][j]=min{dp[i][k]+dp[k+1][j]+cost(i,k,j)}
对于一个k,可以证明:(a < b < c < d)
cost(a,c)+cost(b,d)<=cost(b,c)+cost(a,d)
cost(b,c)<=cost(a,d)
满足四边形优化的条件。
所以决策点满足s[i][j-1]<=s[i][j]<=s[i+1][j](边界:s[i][i]=i)
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=1002,INF=0x3f3f3f3f;
int n,dp[MAXN][MAXN],s[MAXN][MAXN];
struct Node {
int x,y;
}a[MAXN];
inline int cost(int i,int k,int j) {
if (k>=j) return INF;//防止自己更新自己
return a[k+1].x-a[i].x+a[k].y-a[j].y;
}
int main() {
// freopen("hdu 3516.in","r",stdin);
int kase;
while (~scanf("%d",&n)) {
for (int i=1;i<=n;++i) scanf("%d%d",&a[i].x,&a[i].y);
for (int i=1;i<=n;++i) dp[i][i]=0,s[i][i]=i;
for (int len=2;len<=n;++len)
for (int i=1;i+len-1<=n;++i) {
int j=i+len-1;
dp[i][j]=INF;
for (int k=s[i][j-1];k<=s[i+1][j];++k) {
if (dp[i][j]>dp[i][k]+dp[k+1][j]+cost(i,k,j))
dp[i][j]=dp[i][k]+dp[k+1][j]+cost(i,k,j),s[i][j]=k;
}
}
printf("%d\n",dp[1][n]);
}
return 0;
}