算法提高5.状压dp(二)

一.吃奶酪题目链接:https://www.luogu.com.cn/problem/P14331.题目讲解模板TSP问题2.代码实现#include iostream #include cstring #include cmath using namespace std; const int N = 17; int n; double x[N],y[N]; double f[1 N][N]; double dist(int i,int j) { double dx = x[i] - x[j]; double dy = y[i] - y[j]; return sqrt(dx * dx + dy * dy); } int main() { cin n; for(int i = 1;i = n;i++) { ci