题目链接:http://poj.org/problem?id=3311
题意:有一个人从编号为0的点出发,现在想把编号为1~n的点都经过至少一次,最后再回到0号点,每一条边都有一个权值,问走一遍最小值是多少。
思路:状态压缩Dp,由于n很小,先用floyd算出两点之间的最短距离。然后用dp[s][i]表示,当前在i点,经过点的状态为s(用二进制表示每个点当前是否已经走过)的最小值。我们可以把0号点拿出来,初始化dp[1<<(i-1)][i] = a[0][i],然后枚举当前状态i,当前所在点j,以及下一个要到达的点k。然后答案在dp[(1<<n)-1][i] + a[i][0] 里面取最小值。
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007
#define mp make_pair
#define fi first
#define se second
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mid int m=(l+r)>>1
const int maxn = 12;
int a[maxn][maxn];
int n;
int dp[1<<10][11];
void init()
{
Clean(dp,0x3f);
rep(i,0,n)
rep(j,0,n) scanf("%d",&a[i][j]);
rep(k,0,n)
rep(i,0,n)
rep(j,0,n)
if ( 0 != a[i][k] && 0 != a[k][j] )
{
if ( a[i][j] == 0 ) a[i][j] = a[i][k] + a[k][j];
else a[i][j] = min( a[i][j] , a[i][k] + a[k][j] );
}
}
int main()
{
while( ~scanf("%d",&n) )
{
if ( !n ) break;
init();
int uplim = 1<<n;
rep(i,1,n)
dp[1<<(i-1)][i] = ( a[0][i] == 0 )?inf:a[0][i];
rep(i,0,uplim-1)
{
rep(j,0,n-1)
{
rep(k,0,n-1)
if ( !( i & (1<<k) ) && (k != j) )
{
if ( !a[j+1][k+1] ) continue;
int next = i | (1<<k);
dp[next][k+1] = min( dp[next][k+1] , dp[i][j+1] + a[j+1][k+1] );
}
}
}
int ans = inf;
rep(i,1,n)
if ( a[i][0] ) ans = min( ans , dp[uplim-1][i] + a[i][0] );
cout<<ans<<endl;
}
return 0;
}