AcWing 91. 最短Hamilton路径——状态压缩dp

Acwing 91. 最短Hamilton路径-状态压缩dp

题目传送门

# include <iostream>
# include <algorithm>
# include <vector>
# include <stack>
# include <queue>
# include <string>
# include <sstream>
# include <cstdio>
# include <cstring>
# include <cmath>
using namespace std;

const int inf = 0x3f;
const int maxn = 20;
int dp[1 << 20][maxn], mp[maxn][maxn], n;

int main() {
	ios::sync_with_stdio(false);
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> mp[i][j];
		}
	}
	memset(dp, inf, sizeof(dp));
	dp[1][0] = 0;
	for (int i = 1; i < (1 << n); i+=2) {
		for (int j = 0; j < n; j++) {
			if ((i >> j) & 1) {
				for (int k = 0; k < n; k++) {
					if ((i - (1 << j)) >> k & 1) {
						dp[i][j] = min(dp[i][j], dp[i - (1 << j)][k] + mp[k][j]);
					}
				}
			}
		}
	}
	cout << dp[(1 << n) - 1][n - 1] << endl;
	return 0;
}