百练 4124 海贼王之伟大航路
#include<iostream>
#include<cstdio>
#include<queue>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=16;
int G[maxn][maxn],best[maxn][(1<<maxn)];
int minL=(1<<30),N;
void dfs(int u,int cur,int k)
{if(minL<cur||(u==N-1&&k<((1<<N)-1))) return;if(best[u][k]<=cur) return;else best[u][k]=cur;if(u==N-1&&k==((1<<N)-1)) { minL=min(minL,cur);return;}for(int v=0;v<N;v++)if(G[u][v]&&(k&(1<<v))==0) dfs(v,cur+G[u][v],k+(1<<v));
}
int main()
{cin>>N;for(int i=0;i<N;i++)for(int j=0;j<N;j++)cin>>G[i][j];memset(best,0x7f,sizeof(best));dfs(0,0,1);cout<<minL;return 0;
}