【AcWing】1128. 信使

https://www.acwing.com/problem/content/1130/

思路：单源最短路，spfa就能过，但数组一定要开边数的二倍_(:з」∠)_

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

const int maxn = 666;

int n, m;
int h[maxn], e[maxn], ne[maxn], idx, dist[maxn], w[maxn];
bool st[maxn];

int spfa()
{
    memset(dist, 0x3f, sizeof(dist));
    dist[1] = 0;
    st[1] = true;
    queue<int> q;
    q.push(1);
    
    while(q.size())
    {
        int t = q.front();
        q.pop();
        st[t] = false;
        
        for(int i = h[t];i != -1; i = ne[i])
        {
            int j = e[i];
            if(dist[j] > dist[t] + w[i])
            {
                dist[j] = dist[t] + w[i];
                if(!st[j])
                {
                    q.push(j);
                    st[j] = true;
                }
            }
        }
    }
    
    int res = -1;
    for(int i = 1;i <= n; i++)
    {
        if(dist[i] == 0x3f3f3f3f) return -1;
        res = max(res, dist[i]);
    }
    
    return res;
}

void add(int x, int y, int z)
{
    w[idx] = z;
    e[idx] = y;
    ne[idx] = h[x];
    h[x] = idx++;
}

int main()
{
    scanf("%d%d", &n, &m);
    memset(h, -1, sizeof(h));
    while(m--)
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        add(a, b, c);
        add(b, a, c);
    }
    
    printf("%d\n", spfa());
    
    return 0;
}