852. spfa判断负环

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>

using namespace std;

const int N = 2010, M = 10010;

int h[N],e[M],ne[M],w[M],idx;

int dist[N], cnt[N];

bool st[N];

int n, m;

//当cnt[x] >= n 时说明有负权回路。
void add(int a, int b, int c)
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++;
}

bool spfa()
{
    queue<int> q;
    for(int i = 1; i <= n; i ++)
    {
        q.push(i);
        st[i] = true;
    }
    
    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];
                cnt[j] = cnt[t] + 1;
                if(cnt[j] >= n) return true;
                
                if(!st[j])
                {
                    st[j] = true;
                    q.push(j);
                }
            }
            
        }
    }
    
    return false;
}
int main()
{
    cin >> n >> m;
    memset(h, -1, sizeof h);
    
    while(m --)
    {
        int a, b, c;
        cin >> a >> b >> c;
        
        add(a, b ,c);
    }
    if(spfa()) cout << "Yes";
    else cout << "No";
    
    return 0;
    
}//来自acwing