spfa（fellmen-ford队列优化）

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);

using namespace std;

typedef long long ll;
const int MAXN = 1005;
const int INF = 0x3f3f3f3f;
int n, m, lc[MAXN], cnt[MAXN];//cnt[]为入队列次数
bool vis[MAXN];//是否存在队列标志

struct Edge {
	int v, w;
	Edge(int v, int w) :v(v), w(w) {}
};

vector<Edge> E[MAXN];

bool spfa(int start) {
	for (int i = 0; i < n; i++)
		lc[i] = (i == start ? 0 : INF);
	memset(vis, 0, sizeof(vis));
	queue<int> q;
	q.push(start);
	vis[start] = 1;
	memset(cnt, 0, sizeof(cnt));
	cnt[start]++;
	while (!q.empty()) {
		int u = q.front();
		q.pop();
		vis[u] = 0;
		for (int i = 0; i < E[u].size(); i++) {
			int v = E[u][i].v;
			if (lc[v] > lc[u] + E[u][i].w) {
				lc[v] = lc[u] + E[u][i].w;
				if (!vis[v]) {
					vis[v] = 1;
					q.push(v);
					//入队次数大于n次，则存在负环回路
					if (++cnt[v] > n)
						return false;
				}
			}
		}
	}
	return true;
}