最短路是很显然的吧。但是,如果每条边都建出来的话,怕是就算是spfa的O(m)都跑不出来(笑)。。。。
所以,考虑优化建边,按照x排序,相邻两个之间建边就好了,再来y排序,这样,只有n条边了。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define N 200010
#define inf 0x3f3f3f3f
#define pa pair<long long,int>
using namespace std;
struct Node
{
int x,y,id;
}a[N];
int head[N];
long long dis[N];
int n,num;
bool vis[N];
priority_queue<pa,vector<pa>,greater<pa> > q;
bool cmp_x(Node x,Node y) {return x.x<y.x;}
bool cmp_y(Node x,Node y) {return x.y<y.y;}
struct edge
{
int u,v;
long long w;
int next;
edge(){next=-1;}
}ed[4*N];
void build(int u,int v,int w)
{
num++;
ed[num].w=w;
ed[num].v=v;
ed[num].next=head[u];
head[u]=num;
}
void SPFA()
{
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)dis[i]=inf;
dis[1]=0;
q.push(make_pair(0,1));
while(!q.empty())
{
int u=q.top().second;
q.pop();
if(vis[u])continue;
vis[u]=1;
for(int i=head[u];i!=-1;i=ed[i].next)
{
int v=ed[i].v;
if(dis[v]>dis[u]+ed[i].w)
{
dis[v]=dis[u]+ed[i].w;
q.push(make_pair(dis[v],v));
}
}
}
}
int main()
{
memset(head,-1,sizeof(head));
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d%d",&a[i].x,&a[i].y);
a[i].id=i;
}
sort(a+1,a+n+1,cmp_x);
for(int i=1;i<n;i++)
{
build(a[i].id,a[i+1].id,a[i+1].x-a[i].x),
build(a[i+1].id,a[i].id,a[i+1].x-a[i].x);
}
sort(a+1,a+n+1,cmp_y);
for(int i=1;i<n;i++)
{
build(a[i].id,a[i+1].id,a[i+1].y-a[i].y),
build(a[i+1].id,a[i].id,a[i+1].y-a[i].y);
}
SPFA();
printf("%lld\n",dis[n]);
return 0;
}