这题是个好题啊简单的状态压缩,思路如下:
/*状态转移方程:
dp[mask|i|j] = MIN(dp[mask|i|j],dp[mask]+dis[i][j])
列出所有可能,更新可能成为最优解的所有状态,最优解建立在这些这些最优子状态中
要清楚最终要求的状态是什么
保证每一状态的合法性
*/
#include <stdio.h>
#include <math.h>
#define DIS(x1,y1,x2,y2) sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))
#define MIN(a,b) ((a) < (b-esp) ? (a) : (b)) //注意!精度问题
#define INF 100000
double dp[1<<21];
double dis[50][50];
int point[50][2];
double dpfun(int n);
const double esp = 1e-9;
int main()
{
int T,ncase = 0;
int x,y;
int n;
int i,j;
//freopen("A.in","r",stdin);
scanf("%d",&T);
while(T--){
scanf("%d%d%d",&point[0][0],&point[0][1],&n);
n = n * 2;
for(i = 1; i <= n; i++){
scanf("%d%d",&point[i][0],&point[i][1]);
for(j = 0; j < i; j++)
dis[i][j] = dis[j][i] = DIS(point[i][0],point[i][1],point[j][0],point[j][1]);
}
printf("Case #%d: %.2lf\n",++ncase,dpfun(n));
}
return 0;
}
double dpfun(int n)
{
int mark = 0;
int i,j;
int t,cnt,sta;
for(i = 0; i < (1<<n); i++)
dp[i] = INF;
dp[0] = 0;
for(mark = 0; mark < (1 << n); mark++){
if(dp[mark] == INF) //优化1
continue;
for(i = 0; i < n; i++)
if((mark & (1 << i)) == 0)
break; //优化2 由O(n^2) 到 O(n)
for(j = i+1; j < n; j++){
if((mark & (1 << j)) == 0){
sta = (mark|(1<<i)|(1<<j));
dp[sta] = MIN(dp[sta],dp[mark]+dis[i+1][j+1]+dis[i+1][0]);
dp[sta] = MIN(dp[sta],dp[mark]+dis[i+1][j+1]+dis[j+1][0]);
}
}
// printf("%d\n",mark);
}
return dp[(1<<n)-1];
}