关键路径

/*
关键路径--图论最后一个，苦逼的图论复习就要结束了~~OTL... 
*/
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stack>
using namespace std;
const int M=10005;
struct linklist
{
	int s;
	int w;
	linklist *next;
};
linklist map[M];
linklist fmap[M];
bool flag=1;
int etv[M];
int ete[M];
int ltv[M];
int lte[M];
int co[M];
stack<int>s1;
stack<int>s2;
int n , m;
void debug()
{
	for (int i=1; i<=n; i++)
	{
		printf("%d ", etv[i]);
		
	}
	printf("\n");
	for (int i=1; i<=n; i++)
	{
		printf("%d ", ltv[i]);
		
	}
	printf("\n");
}
void insert(linklist &x, int y, int val)
{
	linklist *t;
	t=new(linklist);
	t->s=y;
	t->w=val;
	t->next=x.next;
	x.next=t;
}
void toposort()
{
	int tj=0;
	for (int i=1; i<=n; i++) if (!co[i]) s1.push(i);
	if (s1.empty()) {
	  flag=0;
	  return;
    }
    else 
    {
    	while (!s1.empty())
    	{
    		tj++;
    		int v=s1.top();s2.push(v);
    		co[v]=n+1;
    		s1.pop();
    		for (linklist *j=map[v].next; j!=NULL; j=j->next)
    		{
    			int t=j->s;
    			co[t]--;
    			if (!co[t]) s1.push(t);	
				if (etv[v]+j->w > etv[t]) etv[t]=etv[v]+j->w;
    		}
    	
    	}
    }
	if (tj<n) {
	flag=0;
	return;//check the cycle;
    }
}
void solve()
{
	toposort();
	if (!flag) return;
	for (int i=1; i<=n; i++) ltv[i]=etv[n];
    //debug();
    while (!s2.empty())
    {
    	int v=s2.top();
    	s2.pop();
    	for (linklist *j=fmap[v].next; j!=NULL; j=j->next)
    	{
    		int t=j->s;
    		if (ltv[v]-j->w < ltv[t]) ltv[t]=ltv[v]-j->w;
    	}
    }
	debug();
}
void init()
{
	memset(ete, 0, sizeof(ete));
	memset(lte, 0, sizeof(lte));
	memset(etv, 0, sizeof(etv));
	memset(ltv, 0, sizeof(ltv));
	memset(co, 0, sizeof(co));
	scanf("%d %d", &n, &m);
	for (int i=1; i<=n; i++)
	{
		map[i].s=i;
		map[i].next=NULL;
		map[i].w=0;
		fmap[i].s=i;
		fmap[i].next=NULL;
		fmap[i].w=0;
	}
	for (int i=1; i<=m; i++)
	{
		int x, y, val;
		scanf("%d %d %d", &x, &y, &val);
		insert(map[x], y, val);
		insert(fmap[y], x, val);
		co[y]++;
	}
}
int main(){
	init();
	solve();
	return 0;
}