题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=4824
题意:中文,不解释
题解:双调欧几里德旅行商问题,具体可看dp双调欧几里德旅行商,这里注意的是起点为0,0。
#include<cstdio>
#define FFC(i,a,b) for(int i=a;i<=b;i++)
const int maxn=1011,inf=1e9;
int dp[maxn][maxn],t,n;
struct node{int x,y;}g[maxn];
int abs(int a){return a>0?a:-a;}
int Min(int a,int b){return a>b?b:a;}
int dis(int i,int j){
int s1=abs(g[i].x-g[j].x)*400+abs(g[i].y-g[j].y),s2;
int max=g[i].y>g[j].y?g[i].y:g[j].y,min=Min(g[i].y,g[j].y);
s2=abs(g[i].x-g[j].x)*400+360-max+min;
return s1>s2?s2:s1;
}
int fuck(int n){
FFC(i,1,n)dp[i][i-1]=inf;
dp[1][1]=0,dp[2][1]=dis(2,1);
FFC(i,3,n)FFC(j,1,i-2)
dp[i][j]=dp[i-1][j]+dis(i-1,i),dp[i][i-1]=Min(dp[i][i-1],dp[i-1][j]+dis(j,i));
return dp[n][n-1]+dis(n,n-1);
}
int main(){
scanf("%d",&t);
g[1].x=g[1].y=0;
while(t--){
scanf("%d",&n);
FFC(i,2,n+1)scanf("%d%d",&g[i].x,&g[i].y);
printf("%d\n",fuck(n+1)+n*10);
}
return 0;
}