这个题目的证明略烦,但最后发现和石子归并差不多
老样子,注意初始化
#include <cstdio>
#include <cstring>
const int MAXN = 1000 + 10;
const int inf = 1 << 29;
int dp[MAXN][MAXN], s[MAXN][MAXN];
int x[MAXN], y[MAXN];
int main()
{
int n;
while(scanf("%d", &n) != EOF)
{
for(int i = 1; i <= n; i++)
{
scanf("%d%d", &x[i], &y[i]);
}
for(int i = 1; i <= n; i++)
{
dp[i][0] = 0;
s[i][0] = i;
}
for(int k = 1; k <= n-1; k++)
{
s[n-k+1][k] = n - 1;
for(int i = n - k ; i >= 1; i--)
{
dp[i][i+k] = inf;
for(int j = s[i][k-1]; j <= s[i+1][k]; j++)
{
int temp = dp[i][j] + dp[j+1][i+k] + x[j+1] - x[i] + y[j] - y[i+k];
// printf("i=%d j=%d i+k=%d tem=%d\n",i,j,i+k,temp);
if(temp < dp[i][i+k])
{
dp[i][i+k] = temp;
s[i][k] = j;
}
}
//printf("dp[%d][%d] = %d \n",i,i+k,dp[i][i+k]);
}
// puts("");
}
printf("%d\n",dp[1][n]);
}
return 0;
}