How Long Does It Take

//注意每个邻接点都要计算比较长度，但不是每个邻接点都要入队列；可能有0边，用-1初始化；
#include <iostream>
#include <stack>
#include <queue>
using namespace std;
int Indegree[105] = {0};
int cost[105][105] = {0};
int Earliest[105] = {0};
int N, M;
void init(){
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(cost[i][j] == -1)
                cost[i][j] = 100000;
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
            if(i == j)
                cost[i][j] = 0;
}
int TopSort(){
    queue<int> s;
    for(int i = 0; i < N; i++){
        if(Indegree[i] == 0){
            s.push(i);
            Earliest[i] = 0;
        }
    }
    int cnt = 0;
    while(!s.empty()){
        int v = s.front();
        s.pop();
        cnt++;
        for(int i = 0; i < N; i++){
            if(cost[v][i] < 100000 && v!= i){
                if(Earliest[v] + cost[v][i] > Earliest[i])
                        Earliest[i] = Earliest[v] + cost[v][i];
                if(--Indegree[i] == 0){
                    s.push(i);
                }
            }
        }
    }
    if(cnt != N) return -1;
    else    return 1;
}
int main()
{
    cin >> N >> M;
    for(int i = 0; i < N; i++)
        for(int j = 0; j < N; j++)
                cost[i][j] = -1;
    int L1, L2, L3;
    for(int i = 0; i < M; i++){
        cin >> L1 >> L2 >> L3;
        Indegree[L2]++;
        cost[L1][L2] = L3;
    }
    init();
    int L = TopSort();
    if(L == 1){
        int max1 = 0;
        for(int i = 0; i < N; i++){
            if(Earliest[i] > max1)
                max1 = Earliest[i]; 
        }
        cout << max1;
    }
    else
        cout << "Impossible";
}

Given the relations of all the activities of a project, you are supposed to find the earliest completion time of the project.

Input Specification:

Each input file contains one test case. Each case starts with a line containing two positive integers N (≤100), the number of activity check points (hence it is assumed that the check points are numbered from 0 to N−1), and M, the number of activities. Then M lines follow, each gives the description of an activity. For the i-th activity, three non-negative numbers are given: S[i], E[i], and L[i], where S[i] is the index of the starting check point, E[i] of the ending check point, and L[i] the lasting time of the activity. The numbers in a line are separated by a space.

Output Specification:

For each test case, if the scheduling is possible, print in a line its earliest completion time; or simply output "Impossible".

Sample Input 1:

9 12
0 1 6
0 2 4
0 3 5
1 4 1
2 4 1
3 5 2
5 4 0
4 6 9
4 7 7
5 7 4
6 8 2
7 8 4

Sample Output 1:

18

Sample Input 2:

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

Sample Output 2:

Impossible