链接:点击打开链接
题意:给定一些点(xi,yi)(xj,yj)满足:i<j,xi<xj,yi>yj。用下面的边连起来,使得所有边的长度最小
代码:
<span style="font-family:FangSong_GB2312;font-size:18px;">#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF=0x3f3f3f3f;
int x[1005],y[1005],s[2005][2005],dp[2005][2005];
int main(){
int n,i,j,k,l,ans;
while(scanf("%d",&n)!=EOF){
memset(dp,INF,sizeof(dp));
for(i=1;i<=n;i++){
scanf("%d%d",&x[i],&y[i]);
dp[i][i]=dp[i+n][i+n]=0;
s[i][i]=i,s[i+n][i+n]=i+n;
}
for(l=2;l<=2*n;l++){ //四边形优化,很石子合并一样
for(i=1;i<=2*n-l+1;i++){ //注意每次合并的增加量
j=i+l-1;
for(k=s[i][j-1];k<=s[i+1][j];k++){
if(dp[i][j]>dp[i][k]+dp[k+1][j]+(y[k]-y[j])+(x[k+1]-x[i])){
dp[i][j]=dp[i][k]+dp[k+1][j]+(y[k]-y[j])+(x[k+1]-x[i]);
s[i][j]=k;
}
}
}
}
printf("%d\n",dp[1][n]);
}
return 0;
}
</span>