TSP模板

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n;
struct edge{
    int x;
    int y;
}a[20];
int temp[20][1<<16],dis[20][20],best[1<<16];
const int inf = 0x3f3f3f3f;
int main()
{
    while(~scanf("%d",&n)){
        for(int i = 0; i < n ; i++)
            scanf("%d%d",&a[i].x,&a[i].y);
        int len = 0;
        int maxn = (1<<n)-1;
        for(int i = 0 ; i < n ; i++)
            for(int j = 0; j <n ; j++)
                dis[j][i] = dis[i][j] = ceil(sqrt((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)));
        for(int i = 0 ; i <= maxn; i++)
            best[i]= inf;
        for(int i = 0 ; i <= n ; i++)
            for(int j = 0 ; j <= maxn; j++)
                temp[i][j] = inf;
        temp[0][1] =0;//现在为状态1，当前位置在0
        for(int i = 0 ; i <= maxn ; i++){
            for(int j = 0 ; j < n ; j++){
                if(i&(1<<j)){
                    best[i] = min(best[i],temp[j][i]+dis[j][0]);
                    for(int k = 0 ; k < n ; k++)
                        if(!(i&(1<<k)))
                            temp[k][i|(1<<k)] = min(temp[k][i|(1<<k)],temp[j][i]+dis[j][k]);
                }
            }
        }
        printf("%d\n",best[maxn]);
    }
    return 0;
}