Longest Path in a DAG

Tasks 0..n−1 form a directed acyclic graph. Each edge [u, v, w] means task v can start w hours after task u. Find the length of the longest path (the critical path). Process nodes in topological order.

Implement longest_path(n, edges).

Input

n: The number of nodes. edges: Edges as [from, to, weight].

Output

Return the total weight of the longest path (0 if there are no edges).

Restricciones

1 ≤ n ≤ 100,000; 0 ≤ edges ≤ 200,000; 1 ≤ weight ≤ 10,000; the graph has no cycles

Ejemplos

Entrada:
n = 4
edges = [
    [0, 1, 3],
    [0, 2, 2],
    [1, 3, 4],
    [2, 3, 6]
]

Salida esperada:
expected = 8

Entrada:
long long n = 4;
std::vector<std::vector<long long>> edges = {
    {0, 1, 3},
    {0, 2, 2},
    {1, 3, 4},
    {2, 3, 6}
};

Salida esperada:
long long expected = 8;

Entrada:
long n = 4;
long[][] edges = new long[][] {
    new long[] {0, 1, 3},
    new long[] {0, 2, 2},
    new long[] {1, 3, 4},
    new long[] {2, 3, 6}
};

Salida esperada:
long expected = 8;

Entrada:
n = 3
edges = []

Salida esperada:
expected = 0

Entrada:
long long n = 3;
std::vector<std::vector<long long>> edges = {};

Salida esperada:
long long expected = 0;

Entrada:
long n = 3;
long[][] edges = new long[][] {};

Salida esperada:
long expected = 0;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• Wikipedia: Longest path problem