PTA_数据结构与算法题目集（中文）_7-11 关键活动 （30 分)

• 题目地址
• 题目解析：值得注意的是题目的输出要求--1、输出所有的关键活动。2、关键活动输出的顺序规则是：任务开始的交接点编号小者优先，起点编号相同时，与输入时任务的顺序相反。（利用rbegin()和rend()非常方便!）
• 参考代码
• 我的代码：

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

struct node
{
	int early;
	int last;
	int inDegree;
	int outDegree;
	vector<int>pre;
	vector<int>bak;
	node(int e, int l) :
		early(e), last(l), inDegree(0), outDegree(0) {}
};
const int MAX = 0x3f3f3f3f;

int main()
{
	int n, m;
	scanf("%d %d", &n, &m);

	vector<vector<int>>vv(n + 1, vector<int>(n + 1, -1));
	vector<node>nn(n + 1, node(0, MAX));
	for (int i = 0, a, b, c; i < m; i++)
	{
		scanf("%d %d %d", &a, &b, &c);
		vv[a][b] = c;
		nn[a].outDegree++, nn[a].bak.push_back(b);
		nn[b].inDegree++, nn[b].pre.push_back(a);
	}

	queue<int>qq;
	int count = 0;
	for (int i = 1; i <= n; i++)
		if (nn[i].inDegree == 0)
			qq.push(i), count++;
	while (qq.size())
	{
		int t = qq.front(); qq.pop();

		for (auto it = nn[t].bak.begin(); it != nn[t].bak.end(); it++)
		{
			if (nn[t].early + vv[t][*it] > nn[*it].early)
				nn[*it].early = nn[t].early + vv[t][*it];
			if ((--nn[*it].inDegree) == 0)
				qq.push(*it), count++;
		}
	}
	if (count != n)
	{
		printf("%d", 0);
		return 0;
	}

	int max = 0;
	for (int i = 1; i <= n; i++)
		if (nn[i].early > max)
			max = nn[i].early;
	printf("%d\n", max);
	for (int i = 1; i <= n; i++)
		if (nn[i].outDegree == 0)
			nn[i].last = max, qq.push(i);
	while (qq.size())
	{
		int t = qq.front(); qq.pop();

		for (auto it = nn[t].pre.begin(); it != nn[t].pre.end(); it++)
		{
			if (nn[t].last - vv[*it][t] < nn[*it].last)
				nn[*it].last = nn[t].last - vv[*it][t];
			if ((--nn[*it].outDegree) == 0)
				qq.push(*it);
		}
	}

	for (int i = 1; i <= n; i++)
		if (nn[i].early == nn[i].last)
			for (auto it = nn[i].bak.rbegin(); it != nn[i].bak.rend(); it++)
				if (nn[*it].last - vv[i][*it] == nn[i].last)
					printf("%d->%d\n", i, *it);

	return 0;
}