10305 - Ordering Tasks

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1246

找个就是拓扑排序，套用 刘汝佳—算法竞赛入门经典就可以过了，代码如下：

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
const int N = 210;
int mp[N][N], tp[N], book[N], n, t;
int tp_DAG();
int dfs(int i);

int main()
{
    int i, m, u, v;
    while(scanf("%d%d", &n, &m), n + m)
    {
        memset(mp, 0, sizeof(mp));
        memset(book, 0, sizeof(book));
        memset(tp, 0, sizeof(tp));
        for(i = 1; i <= m; i++)
        {
            scanf("%d%d", &u, &v);
            mp[u][v] = 1;
        }
        if(tp_DAG())
        {
            for(i = 1; i <= n; i++)
                printf("%d%c", tp[i], i == n ? '\n' : ' ');
        }
    }
    return 0;
}

int tp_DAG()
{
    t = n;
    int i;
    for(i = 1; i <= n; i++)
        if(!book[i] && !dfs(i))
        return 0;
    return 1;
}

int dfs(int i)
{
    int j;
    book[i] = -1; 
    for(j = 1; j <= n; j++)
    {
        if(mp[i][j])
        {
            if(book[j] == -1)   return 0;
            if(!book[j] && !dfs(j))   return 0;
        }
    }
    book[i] = 1;
    tp[t--] = i;
    return 1;
}