2017 ACM/ICPC 乌鲁木齐赛区 H题，dfs 记忆化 O（n）

已经给定了顺序，相当于有向边

d [ i ]  表示第 i 结点能到达的最远距离

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 10000 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;
int T, n, m;
ll d[maxn];
int vis[maxn];
struct node {
    int u;
    ll v;
    node() {}
    node(int u_, ll v_) : u(u_), v(v_) {}
};
vector<node> vec[maxn];

void init() {
    memset(vis, 0, sizeof vis);
    memset(d, -1, sizeof d);
    int u, v;
    ll l;
    for(int i = 0; i <= n; ++i) vec[i].clear();
    for(int i = 0; i < m; ++i) {
        cin >> u >> v >> l;
        vec[u].push_back(node(v, l));
        vis[v] = 1;
    }
}

ll dfs(int id) {
    ll ans = 0;
    for(int i = 0; i < vec[id].size(); ++i) {
        if(d[vec[id][i].u] != -1) ans = max(ans, vec[id][i].v + d[vec[id][i].u]);
        else {
            d[vec[id][i].u] = dfs(vec[id][i].u);
            ans = max(ans, vec[id][i].v + d[vec[id][i].u]);
        }
    }
    d[id] = ans;
    return d[id];
}

int main() {
    ios::sync_with_stdio(false);
    cin >> T;
    while(T--) {
        cin >> n >> m;
        ll res = 0;
        init();
        for(int i = 1; i <= n; ++i) {
            if(vis[i] == 0) {
                d[i] = dfs(i);
                res = max(res, d[i]);
            }
        }
        cout << res << endl;
    }

    return 0;
}