08-图9 关键活动

多起点多终点的情况下，要把每个终点的latest设成所有终点中最大的earlist。

#include<iostream>
#include<functional>
#include<vector>
#include<algorithm>
#include<numeric>
#include<limits.h>
#include<queue>
using namespace std;
struct edge {
	int index, len, moblie;
};
struct node {
	int earlist, latest;
	vector<edge> chds;
	vector<edge> pars;
};
struct work {
	int start, end;
};
bool cpm(const work& w1, const work &w2) {
	return w1.start > w2.start;
}
vector<node> g;
int indegree[105];
int n, m;
vector<work> ans;
int main()
{
	cin >> n >> m;
	g.resize(n+1);
	int c1, c2, len;
	for (int i = 0; i < m; ++i) {
		cin >> c1 >> c2 >> len;
		g[c1].earlist = 0;
		g[c1].latest = INT_MAX;
		g[c2].earlist = 0;
		g[c2].latest = INT_MAX;
		g[c1].chds.push_back(edge{ c2,len,0 });
		g[c2].pars.push_back(edge{ c1,len,0 });
	}
	for (int i = 1; i <= n; ++i) indegree[i] = g[i].pars.size();
	queue<int> q;
	for (int i = 1; i <= n; ++i) {
		if (indegree[i] == 0) q.push(i);
	}
	int cur, ct(0);
	//  计算earlist
	while (!q.empty()) {
		cur = q.front();
		q.pop();
		ct++;
		for (auto &e : g[cur].chds) {
			g[e.index].earlist = max(g[e.index].earlist, g[cur].earlist + e.len);
			if (--indegree[e.index] == 0) q.push(e.index);
		}
	}
	//不可行
	if (ct != n) {
		cout << 0;
		return 0;
	}
	int maxearlist = 0;
	for (int i = 1; i <= n; ++i) maxearlist = max(maxearlist, g[i].earlist);
	//  输出最快时间
	cout << maxearlist << endl;
	for (int i = 1; i <= n; ++i) indegree[i] = g[i].chds.size();
	for (int i = 1; i <= n; ++i) {
		if (indegree[i] == 0) {
			g[i].latest = maxearlist;
			q.push(i);
		}
	}
	//  计算latest和关键路径
	while (!q.empty()) {
		cur = q.front();
		q.pop();
		for (auto &c : g[cur].chds) {
			if (g[c.index].latest - c.len - g[cur].earlist == 0) {
				ans.push_back(work{ cur,c.index });
			}
		}
		for (auto &e : g[cur].pars) {
			g[e.index].latest = min(g[e.index].latest, g[cur].latest - e.len);
			if (--indegree[e.index] == 0) q.push(e.index);
		}
	}
	stable_sort(ans.begin(), ans.end(), cpm);
	for (int i = ans.size()-1; i >=0; --i) {
		cout << ans[i].start << "->" << ans[i].end << endl;
	}
	return 0;
}