AcWing 91. 最短Hamilton路径
原题链接
中等
作者:
George
,
2020-11-15 14:21:47
,
所有人可见
,
阅读 279
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 20, M = 1 << N;
int w[N][N], f[M][N];
int main(){
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) scanf("%d", &w[i][j]);
memset(f, 0x3f, sizeof f);
f[1][0] = 0;
for(int i = 0 ; 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]+w[k][j]);
}
}
}
}
printf("%d", f[(1<<n)-1][n-1]);
return 0;
}