题目:
https://www.luogu.org/problem/show?pid=1433
思路:
预处理两点距离,不处理可能会TLE(可以卡常),
总结:
1.对于重复性的东西可以预处理,减少搜索时间;
2.搜索尽量做到预处理;
3.数组开大开大!!!!!
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef double dou;
const int MAXN=1210;
int n;
dou ss[16][16],ans=21474;
bool vis[MAXN];
struct hh {dou x,y;}ma[MAXN];
void dfs(int pos,dou tot,int num)
{
if(tot>=ans) return;
if(num==n) { ans=min(ans,tot);return;}
for(int i=1;i<=n;i++)
if(!vis[i])
{
vis[i]=1;
dfs(i,tot+ss[pos][i],num+1);
vis[i]=0;
}
return;
}
void solve()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%lf%lf",&ma[i].x,&ma[i].y);
ma[0].x=ma[0].y=0;
for(int i=0;i<=n;i++)
for(int j=i+1;j<=n;j++)
{
dou x1=ma[i].x,y1=ma[i].y,x2=ma[j].x,y2=ma[j].y;
ss[j][i]=ss[i][j]=sqrt(abs((x1-x2)*(x1-x2))+abs((y1-y2)*(y1-y2)));
}
dfs(0,0,0);
printf("%.2lf",ans);
}
int main()
{
solve();
return 0;
}