POJ 3268 最短路

建反向边 做两遍SPFA

#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;

struct node
{
    int v, w, next;
}edge[111111], redge[111111];

int head1[1111], head2[1111], cnt1, cnt2;
int dist1[1111], dist2[1111];
int n, m, x;
bool inq[1111];

inline void addnode(int u, int v, int w)
{
    edge[cnt1].v = v; edge[cnt1].w = w;
    edge[cnt1].next = head1[u]; head1[u] = cnt1++;
    redge[cnt2].v = u; redge[cnt2].w = w;
    redge[cnt2].next = head2[v]; head2[v] = cnt2++;
}

void solve()
{
    int i, j, k, u, v;
    queue < int > q;
    fill(dist1, dist1 + n + 1, INF);
    memset(inq, false, sizeof(inq));
    inq[x] = true;
    dist1[x] = 0;
    q.push(x);
    while (!q.empty())
    {
        u = q.front(); q.pop();
        inq[u] = false;
        for (i = head1[u]; i != -1; i = edge[i].next)
        {
            v = edge[i].v;
            if (dist1[u] + edge[i].w < dist1[v])
            {
                dist1[v] = dist1[u] + edge[i].w;
                if (!inq[v]) {q.push(v); inq[v] = true;}
            }
        }
    }
    fill(dist2, dist2 + n + 1, INF);
    memset(inq, false, sizeof(inq));
    inq[x] = true; dist2[x] = 0;
    q.push(x);
    while (!q.empty())
    {
        u = q.front(); q.pop();
        inq[u] = false;
        for (i = head2[u]; i != -1; i = redge[i].next)
        {
            v = redge[i].v;
            if (dist2[u] + redge[i].w < dist2[v])
            {
                dist2[v] = dist2[u] + redge[i].w;
                if (!inq[v]) {q.push(v); inq[v] =true;}
            }
        }
    }
    int mm = -1;
    for (i = 1; i <= n; ++i)
        mm = MAX(dist1[i] + dist2[i], mm);
    printf("%d\n", mm);
}




int main()
{
    while (scanf("%d%d%d", &n, &m, &x) != EOF)
    {
        memset(head1, -1, sizeof(head1));
        memset(head2, -1, sizeof(head2));
        cnt1 = cnt2 = 0;
        int i, u, v, w;
        for (i = 0; i < m; ++i)
        {
            scanf("%d%d%d", &u, &v, &w);
            addnode(u, v, w);
        }
        solve();
    }
    return 0;
}