题目链接:点击打开链接
起点到某个顶点v的次短路要么是到某个顶点u的最短路加上(u,v),要么是到u的次短路加上(u,v),因此需要记录所有起点到其它点的次短路与最短路
这里使用STL和图的邻接表+迪杰斯特拉来实现
AC代码如下:
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
#define MAXN_V 5005
#define INF 1000000000
struct edge{
int to, cost;
edge(int t, int c):to(t), cost(c){}
};
typedef pair<int, int> P;
int N, R;
vector<edge> Gra[MAXN_V];
int d[MAXN_V];
int d2[MAXN_V];
void dijkstra(int s)
{
priority_queue<P, vector<P>, greater<P> > que;
fill(d, d+N+1, INF);
fill(d2, d2+N+1, INF);
d[s] = 0;
que.push(P(0, s));
while(!que.empty())
{
P p = que.top(); que.pop();
int v = p.second;
if(d2[v]<p.first) continue;
for(int i=0; i<Gra[v].size(); ++i)
{
edge &e = Gra[v][i];
int dt2 = p.first + e.cost;
if(d[e.to]>dt2)
{
swap(d[e.to],dt2);
que.push(P(d[e.to],e.to));
}
if(d2[e.to]>dt2&&d[e.to]<dt2)
{
d2[e.to] = dt2;
que.push(P(d2[e.to], e.to));
}
}
}
}
int main()
{
cin>>N>>R;
for(int i=0;i<R;++i)
{
int f, to, cost;
cin>>f>>to>>cost;
Gra[f].push_back(edge(to,cost));
Gra[to].push_back(edge(f,cost));
}
dijkstra(1);
cout<<d2[N]<<endl;
return 0;
}