AcWing 91. 最短Hamilton路径
原题链接
中等
作者:
AC_
,
2021-01-29 21:20:34
,
所有人可见
,
阅读 298
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 20, M = 1 << 20;
int n;
int a[N][N];
int f[M][N];
int main()
{
cin >> n;
for (int i = 0; i < n; i ++)
for (int j = 0; j < n; j ++)
cin >> a[i][j];
memset(f, 0x3f, sizeof f);
for (int i = 0; i < n; i ++) f[1][i] = a[0][i];
for (int i = 1; i < (1 << n); i ++)
for (int j = 0; j < n; j ++)
if ((i >> j) & 1)
for (int k = 0; k < n; k ++)
if (((i - (1 << j)) >> k) & 1)
f[i][j] = min(f[i][j], f[i - (1 << j)][k] + a[k][j]);
cout << f[(1 << n) - 1][n - 1];
return 0;
}