2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 H Skiing【拓扑排序，关键路径】

2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛  H Skiing

In this winter holiday, Bob has a plan for skiing at the mountain resort.

This ski resort has MM different ski paths and NN different flags situated at those turning points.

The ii-th path from the S_iS​i​​-th flag to the T_iT​i​​-th flag has length L_iL​i​​.

Each path must follow the principal of reduction of heights and the start point must be higher than the end point strictly.

An available ski trail would start from a flag, passing through several flags along the paths, and end at another flag.

Now, you should help Bob find the longest available ski trail in the ski resort.

Input Format

The first line contains an integer TT, indicating that there are TT cases.

In each test case, the first line contains two integers NN and MM where 0 < N leq 100000<N≤10000 and 0 < M leq 1000000<M≤100000as described above.

Each of the following MM lines contains three integers S_iS​i​​, T_iT​i​​, and L_i~(0 < L_i < 1000)L​i​​ (0<L​i​​<1000) describing a path in the ski resort.

Output Format

For each test case, ouput one integer representing the length of the longest ski trail.

样例输入

1
5 4
1 3 3
2 3 4
3 4 1
3 5 2

样例输出

6

http://blog.csdn.net/yo_bc/article/details/77917288：

给定一个有向无环图，求最长路径。
由于是有向无环图，所以最长路肯定是一个入度为0到出度为0的路径，拓扑排序在确定当前点之前能够考虑到所有到它的情况，所以最后取个最值即可。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1e4+10;
vector<pair<int,int> >edge[maxn];
int T,n,m;
int deg[maxn],val[maxn];
queue<int> q;

void init()
{
    for(int i=0;i<=n;i++){
        edge[i].clear();
    }
    memset(val,0,sizeof(val));
    memset(deg,0,sizeof(deg));
}

void toposort()
{
    while(!q.empty()) q.pop();
    for(int i=0;i<=n;i++){
        if(!deg[i]) q.push(i);
    }
    while(!q.empty())
    {
        int u=q.front();q.pop();
        for(int i=0;i<edge[u].size();i++){
            int v=edge[u][i].first;
            val[v]=max(val[v],val[u]+edge[u][i].second);
            if(--deg[v]==0) q.push(v);
        }
    }
    printf("%d
",*max_element(val+1,val+1+n));
}

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        init();
        int u,v,w;
        for(int i=0;i<m;i++){
            scanf("%d%d%d",&u,&v,&w);
            edge[u].push_back(make_pair(v,w));
            deg[v]++;
        }
        toposort();
    }
    return 0;
}