for (int i = 0; i <= full; i++)
	for (int j = 1; j <= n; j++)
		if (! (i & (1 << (j - 1))))
			for (int k = 1; k <= n; k++)
				if (i & (1 << (k - 1)))
					dp[i | (1 << (j - 1))][j] = min(dp[i | (1 << (j - 1))][j], dp[i][k] + mp[k][j]);

这样写为什么不会TLE