这道题可以用拓扑排序做,也可以用SPFA,Dijkstra
// 拓扑排序
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define MAXN 1510
#define MAXM 50010
#define INF 0x3f3f3f3f
using namespace std;
int n,m,u,v,w,in[MAXN],d[MAXN],head[MAXN],cnt;
queue<int> q;
struct Edge{
int to,nxt,w;
}edge[MAXM];
void addedge(int u,int v,int w){
edge[cnt].to=v;edge[cnt].nxt=head[u];edge[cnt].w=w;head[u]=cnt++;
}
int main(){
#ifdef WINE
freopen("data.in","r",stdin);
#endif
memset(head,-1,sizeof(head));
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++){
scanf("%d%d%d",&u,&v,&w);
addedge(u,v,w);in[v]++;
}
for(int i=1;i<=n;i++)if(!in[i])q.push(i);
d[1]=INF;
while(!q.empty()){
int u=q.front();q.pop();
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i].to,w=edge[i].w;in[v]--;
d[v]=max(d[v],d[u]+w);
if(!in[v])q.push(v);
}
}
if(d[n])printf("%d",d[n]-INF);
else printf("-1");
return 0;
}