POJ3268 Silver Cow Party

题目链接：http://poj.org/problem?id=3268

头一次用邻接矩阵写spfa，真心弱爆了，而且矩阵转置写错了，线性代数是硬伤啊……

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
using namespace std;
#define N 1010
int e[N][N], n, m, k, x, y, z, tt[N], g[N];
bool f[N];
queue<int> Q;
void init(){
    for (int i = 0; i <= n; i++) g[i] = (1 << 31 - 1);
    memset(f, 0, sizeof(f));
}
void spfa(int ts){
    g[ts] = 0; f[ts] = 1; Q.push(ts);
    while (!Q.empty()){
        int now = Q.front();
        Q.pop(); f[now] = 0;
        for (int i = 1; i <= n; i++){
            if (e[now][i] != 0 && g[i] > g[now] + e[now][i]){
                g[i] = g[now] + e[now][i];
                if (!f[i]){Q.push(i); f[i] = 1;}
            }
        }
    }
    for (int i = 1; i <= n; i++) tt[i] += g[i];
}
void zz(){
    for (int i = 1; i <= n; i++)
      for (int j = 1; j < i; j++){
          int t = e[i][j]; e[i][j] = e[j][i]; e[j][i] = t;
      }
}
int main(){
    while (~scanf("%d%d%d", &n, &m, &k)){
        init();
        memset(tt, 0, sizeof(tt));
        memset(e, 0, sizeof(e));
        while (m--){
            scanf("%d%d%d", &x, &y, &z);
            e[x][y] = z;
        }
        spfa(k);
        zz();
        init();
        spfa(k);
        int ans = 0;
        for (int i = 1; i <= n; i++) ans = max(ans, tt[i]);
        printf("%d\n", ans);
    }
    return 0;
}