POJ ~ 3268 ~ Silver Cow Party （Dijkstra + 逆向建边）

题意：输入N，M，X。N表示有N头牛，牛1在1处，牛2在2处，依次编号为1~n，这些牛要在牛X聚会，有M条单向道路，聚完会他们需要回到各自原来的地方。问哪个牛走的路最远？输出这个牛走的距离？

思路：先正向建边，跑一边Dijkstra的出来牛X到所有牛的距离（即回家的长度）记录下来，然后在反向建边，跑一边Dijkstra求出所有牛到牛X处需要走的距离。两个加起来就是每个牛走的路径长度，求一个最大值即可。

Dijkstra：

//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
const int MAXN = 1e3 + 5;
const int MAXM = 1e5 + 5;
const int INF = 0x3f3f3f3f;
struct Edge
{
    int from, to, dist;       //起点,终点,距离
    Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};

struct Dijkstra
{
    int n, m;                 //结点数,边数(包括反向弧)
    vector<Edge> edges;       //边表。edges[e]和edges[e^1]互为反向弧
    vector<int> G[MAXN];      //邻接表，G[i][j]表示结点i的第j条边在edges数组中的序号
    int vis[MAXN];            //标记数组
    int d[MAXN];              //s到各个点的最短路
    int pre[MAXN];            //上一条弧

    void init(int n)
    {
        this->n = n;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }

    void add_edge(int from, int to, int dist)
    {
        edges.push_back(Edge(from, to, dist));
        m = edges.size();
        G[from].push_back(m - 1);
    }

    void dijkstra(int s)
    {
        for (int i = 0; i <= n; i++) d[i] = INF;
        d[s] = 0;
        memset(vis, 0, sizeof(vis));
        for (int i = 1; i <= n; i++)
        {
            int  pos, MIN = INF;
            for (int j = 1; j <= n; j++)
            {
                if(!vis[j] && d[j] <= MIN) MIN = d[pos = j];
            }
            vis[pos] = true;
            for (int j = 0; j < G[pos].size(); j++)
            {
                Edge& e = edges[G[pos][j]];
                if (d[e.to] > d[pos] + e.dist)
                {
                    d[e.to] = d[pos] + e.dist;
                    pre[e.to] = G[pos][j];
                }
            }
        }
    }
};
Dijkstra solve;
struct In
{
    int u, v, w;
}in[MAXM];
int ans1[MAXN], ans2[MAXN];
int main()
{
    int n, m, X;
    while (~scanf("%d%d%d", &n, &m, &X))
    {
        solve.init(n);
        for (int i = 0; i < m; i++) scanf("%d%d%d", &in[i].u, &in[i].v, &in[i].w);
        for (int i = 0; i < m; i++) solve.add_edge(in[i].u, in[i].v, in[i].w);
        solve.dijkstra(X);
        for (int i = 1; i <= n; i++) ans1[i] = solve.d[i];

        solve.init(n);
        for (int i = 0; i < m; i++) solve.add_edge(in[i].v, in[i].u, in[i].w);
        solve.dijkstra(X);
        for (int i = 1; i <= n; i++) ans2[i] = solve.d[i];

        int ans = -INF;
        for (int i = 1; i <= n; i++) ans = max(ans, ans1[i] + ans2[i]);
        printf("%d\n", ans);
    }
    return 0;
}
/*
4 8 2
1 2 4
1 3 2
1 4 7
2 1 1
2 3 5
3 1 2
3 4 4
4 2 3
*/