网上说这道题属于基本题,但我觉得构图不好构,构完图就是裸的最短路。
最近老发迷糊,在细节上花太多时间,不是这犯点错,就是那犯点错,归结起来有些浮躁啊!给自己点冷水,静一静。
#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<climits>
using namespace std;
const int inf=1000000000;
struct node
{
int x,y;
} sue[250];
int n;
double city[250][250];
double dis[250];
bool vis[210];
double dijkstra()
{
for(int i=0; i<n; i++)
{
dis[i]=city[0][i];
}
dis[0]=0;
vis[0]=1;
int biao;
for(int i=1; i<n; i++)
{
int max1=INT_MAX;
for(int j=1; j<n; j++)
if(!vis[j]&&dis[j]<max1)
{
max1=dis[j];
biao=j;
}
vis[biao]=1;
for(int j=0; j<n; j++)
if(dis[j]>dis[biao]+city[biao][j])
dis[j]=dis[biao]+city[biao][j];
}
return dis[1];
}
double juli(node & sp, node & ep)
{
double dx = (sp.x - ep.x) * (sp.x - ep.x);
double dy = (sp.y - ep.y) * (sp.y - ep.y);
return sqrt(dx + dy);
}
int main()
{
//freopen("in.txt","r",stdin);
int m;
n=m=2;
double d;
for(int i=0;i<=210;i++)
for(int j=0;j<=210;j++)
city[i][j]=inf;
cin>>sue[0].x>>sue[0].y>>sue[1].x>>sue[1].y;
while(scanf("%d%d",&sue[n].x,&sue[n].y)!=EOF)
{
if(sue[n].x==-1&&sue[n].y==-1)
{
m=n;
continue;
}
if(n!=m)
{
d=juli(sue[n],sue[n-1]);
city[n][n-1]=city[n-1][n]=3*d/2000;
}
n++;
}
memset(vis,false,sizeof(vis));
for(int i=0; i<n; i++)
for(int j=i+1; j<n; j++)
{
if(city[i][j]==inf)
{
d=juli(sue[i],sue[j]);
city[i][j]=city[j][i]=3*d/500;
}
}
printf("%.0lf\n",dijkstra());
return 0;
}