题目大意:
有向图,给定某个顶点X,问所有点到X以及从X返回原点之和最小值中的最大值是多少。
分析:这题可以用djkstra做,但是 分别求单源最短路的话,时间复杂度比较高。
可以通过反向见图,求所有点到X的最短路。
Code(1):
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<iostream>
using namespace std;
typedef pair<int,int> P;
const int MAXN = 1010;
const int INF = 0x3f3f3f3f;
struct edge{
int to,w;
edge(){}
edge(int tt, int ww):to(tt),w(ww){};
};
vector<edge> G[MAXN];
int d[MAXN];
int dis[MAXN][MAXN];
int n,m,x;
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P> > q;
fill(d,d+n+1,INF);
d[s] = 0;
q.push(P(0,s));
while(!q.empty()){
P p = q.top(); q.pop();
int u = p.second;
if(d[u] < p.first) continue; // 注意这里
for(int v = 0; v < G[u].size(); ++v){
edge e = G[u][v];
if(d[e.to] > d[u] + e.w){
d[e.to] = d[u] + e.w;
q.push(P(d[e.to],e.to));
}
}
}
}
int main()
{
ios::sync_with_stdio(false);
int a,b,c;
while(cin >> n >> m >> x){
for(int i = 0; i <= n; ++i){
for(int j = 0; j <= n; ++j){
dis[i][j] = INF;
}
}
for(int i = 0; i < m; ++i){
cin >> a >> b >> c;
G[a].push_back(edge(b,c));
}
for(int i = 1; i <= n; ++i){
dijkstra(i);
for(int j = 1; j <= n; ++j){
dis[i][j] = d[j];
}
}
int ans = 0;
for(int i = 1; i <= n; ++i){
ans = max(ans,dis[i][x]+dis[x][i]);
}
cout << ans << endl;
}
return 0;
}
Code(2):反向建图,前向星
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 100100;
int u[N],v[N],w[N],d[N]; //这里记录的是边的个数 N范围一定是边的个数
int res[2][N]; // 0 记录 x 到其他点 ,1记录其他点到x
int head[N],tol;
int n,m,x;
typedef pair<int,int> pii;
struct Edge{
int u,v,w,nex;
}e[N];
void init(){
tol = 0;
memset(head,-1,sizeof(head));
}
void addEdge(int u, int v, int w){
e[tol].u = u; e[tol].v = v;e[tol].w = w;
e[tol].nex = head[u];
head[u] = tol++;
}
void dijkstra(int s){
priority_queue<pii,vector<pii>,greater<pii> > q;
while(!q.empty()) q.pop();
for(int i = 1; i <= n; ++i) d[i] = (i==s ? 0 : INF);
q.push(pii(d[s],s));
int u,v,w;
while(!q.empty()){
pii p = q.top(); q.pop();
u = p.second;
if(d[u] < p.first) continue;
for(int i = head[u]; i != -1; i = e[i].nex){
u = e[i].u; v = e[i].v; w = e[i].w;
if(d[v] > w + d[u]){
d[v] = w + d[u];
q.push(pii(d[v],v));
}
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
while(cin >> n >> m >> x){
init();
for(int i = 0; i < m; ++i){
cin >> u[i] >> v[i] >> w[i];
addEdge(u[i],v[i],w[i]);
}
dijkstra(x);
for(int i = 1; i <= n; ++i){
res[0][i] = d[i];
}
init();
for(int i = 0; i < m; ++i){
addEdge(v[i],u[i],w[i]);
}
dijkstra(x);
for(int i = 1; i <= n; ++i) res[1][i] = d[i];
int ans = 0;
for(int i = 1; i <= n; ++i){
if(res[0][i] + res[1][i] < INF){
ans = max(res[0][i] + res[1][i],ans);
}
}
cout << ans << endl;
}
return 0;
}