题目大意:求一张图的次最短路,可以回溯;
题目解析:次最短路肯定与最短路有关系,次最短路肯定是在最短路的基础上,不走一部分走了另一条边,最后又回到了最短路,所以我们需要枚举所有边,因为是稀疏图,用spaf较为好些;
AC代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
using namespace std;
const int maxn=5010;
const int inf=0x3fffffff;
vector<int>e[maxn];
vector<int>w[maxn];
int dist1[maxn],dist2[maxn],n;
bool vis[maxn];
void spaf(int pos,int dist[])
{
int i;
memset(vis,0,sizeof(0));
queue<int>q;
dist[pos]=0;
for(i=1;i<=n;i++)
{
if(i!=pos)
dist[i]=inf;
}
vis[pos]=1;
q.push(pos);
while(!q.empty())
{
int u=q.front();
vis[u]=0;
q.pop();
for(i=0;i<e[u].size();i++)
{
int v=e[u][i];
if(dist[v]>dist[u]+w[u][i])
{
dist[v]=dist[u]+w[u][i];
if(vis[v]==0)
{
q.push(v);
vis[v]=1;
}
}
}
}
}
int main()
{
int cas,c,i,u,v,ww,ans,m,j;
scanf("%d",&cas);
for(c=1;c<=cas;c++)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
e[i].clear();
w[i].clear();
}
while(m--)
{
scanf("%d%d%d",&u,&v,&ww);
e[u].push_back(v);
w[u].push_back(ww);
e[v].push_back(u);
w[v].push_back(ww);
}
spaf(1,dist1);
spaf(n,dist2);
int temp=dist1[n];
ans=inf;
for(i=1;i<=n;i++)
{
for(j=0;j<e[i].size();j++)
{
int v=e[i][j];
if(dist1[i]+dist2[v]+w[i][j]>temp&&dist1[i]+dist2[v]+w[i][j]<ans)
{
ans=dist1[i]+dist2[v]+w[i][j];
}
}
}
printf("Case %d: %d\n",c,ans);
}
return 0;
}