POJ 3311 Hie with the Pie

状压DP，先用flyd预处理求出每两点之间的最小花费，再以dp[i][j]表示状态为i时且终点为j的最小花费，则：dp[x][k] = min(dp[x][k],dp[i][j]+Map[j][k])；x为从状态i的终点j走到k点的状态。

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef __int64 int64;
typedef long long ll;
#define M 100005
#define inf 0x3f3f3f3f
#define mod 1000000007

int n , Map[15][15] , dp[1<<15][15];

void Floyd()
{
	int i , j , k;
	for (k = 0 ; k <= n ; k++)
		for (i = 0 ; i <= n ; i++)
			for (j = 0 ; j <= n ; j++)
				Map[i][j] = min(Map[i][k]+Map[k][j],Map[i][j]);
}

int Solve()
{
	int i , j, k;
	memset(dp , inf , sizeof dp);
	dp[1][0] = 0;
	int up = 1<<(n+1);
	for (i = 1 ; i < up ; i++)
	{
		for (j = 0 ; j <= n ; j++)
		{
			if (dp[i][j] >= inf)continue;
			for (k = 0 ; k <= n ; k++)
			{
				if (j == k)continue;
				if (i & (1<<k))continue;
				int x = i+(1<<k);
				dp[x][k] = min(dp[x][k],dp[i][j]+Map[j][k]);
				
			}
		}
	}
	int ret = inf;
	for (i = 0 ; i <= n ; i++)
		ret = min(ret,dp[up-1][i]+Map[i][0]);
	return ret;
}

int main()
{
	int i , j;
	while (scanf("%d",&n) , n)
	{
		for (i = 0 ; i <= n ; i++)
			for (j = 0 ; j <= n ; j++)
				scanf("%d",&Map[i][j]);
		Floyd();
		printf("%d\n",Solve());
	}
	return 0;
}