P1807 最长路(spfa||拓扑排序||广搜)

最长路 - 洛谷https://www.luogu.com.cn/problem/P1807

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
int head[MAXN];
int nxt[MAXN];
int ver[MAXN];
int cost[MAXN];
int in[MAXN];
int cnt;
int d[MAXN];
inline void add(int x, int y, int c) {
	ver[++cnt] = y;
	cost[cnt] = c;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

inline void topsort() {
	queue<int> que;
	d[1] = 0;
	for (int i = 1; i <= n; i++) {
		if (in[i] == 0) {
			que.push(i);
		}
	}
	while (!que.empty()) {
		int x = que.front();
		que.pop();
		for (int i = head[x]; i; i = nxt[i]) {
			int y = ver[i];
			if (d[y] < d[x] + cost[i]) {
				d[y] = d[x] + cost[i];
			}
			if (--in[y] == 0) {
				que.push(y);
			}
		}
	}
	if (d[n] < 0) {
		printf("%d", -1);
	} else {
		printf("%d", d[n]);
	}
}

int main() {
	memset(d, -0x7f, sizeof(d));
	int x, y, c;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d %d", &x, &y, &c);
		in[y]++;
		add(x, y, c);
	}
	topsort();
	return 0;
}