BOJ 334 大扫除 拓扑排序

很裸的一个拓扑排序。

/*
ID: CUGB-wwj
PROG:
LANG: C++
*/
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
#define MAXN 11050
#define INF 1000000000
#define L(x) x<<1
#define R(x) x<<1|1
#define PI acos(-1.0)
#define eps 1e-3
using namespace std;
struct node
{
    int v, next;
}edge[100 * MAXN];
int head[MAXN], e, n, tx[MAXN], in[MAXN], txp[MAXN];
void insert(int x, int y)
{
    edge[e].v = y;
    edge[e].next = head[x];
    head[x] = e++;
}
void topsort()
{
    queue<int>q;
    for(int i = 1; i <= n; i++)
    if(in[i] == 0) {q.push(i); txp[i] = tx[i];}
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].v;
            txp[v] = max(txp[v], txp[u] + tx[v]); //使用max保证该任务的先决任务都能完成
            in[v]--;
            if(in[v] == 0) q.push(v);
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
    ans = max(txp[i], ans);  //用max找出最晚一个点完成的时间
    cout << ans << endl;
}
int main()
{
    while(scanf("%d", &n) != EOF && n)
    {
        int t, x;
        memset(head, -1, sizeof(head));
        memset(in, 0, sizeof(in));
        memset(txp, 0, sizeof(txp));
        e = 0;
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &tx[i]);
            scanf("%d", &t);
            while(t--)
            {
                scanf("%d", &x);
                insert(i, x);
                in[x]++;
            }
        }
        topsort();
    }
    return 0;
}