TSP(个人模版)

O（n^2）TSP：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
int n,d[1005],dp[1005][1005];
int dis(int a,int b)
{
    int tmp=abs(d[a]-d[b]);
    return min(tmp,360-tmp);
}
int TSP_Dp()
{
    dp[2][1]=dis(1,2);
    for (int i = 3; i <= n + 1; i++) {
        dp[i][i-1] = INF;

        for (int j = 1; j < i-1; j++) {
            dp[i][i-1] = min(dp[i][i-1], dp[i-1][j] + dis(i, j));
            dp[i][j] = dp[i-1][j] + dis(i, i-1);
        }
    }

    int ans = INF;
    for (int i = 1; i <= n; i++)
        ans = min(ans, dp[n+1][i] + dis(n+1, i));
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        d[1]=0;
        int ans=0;
        scanf("%d",&n);
        for(int i=2;i<=n+1;i++)
        {
            int a;
            scanf("%d%d",&a,&d[i]);
            if(i==n+1)ans+=a*800;
            ans+=10;
        }
        ans+=TSP_Dp();
        printf("%d\n",ans);
    }
}