#牛客网 拓扑排序 HNOI2015 菜肴制作

看题目第一眼以为是字典序，敲完发现并不是 QAQ， 正确写法应该是反着存，字典序按从大到小排就OK了，一般拓扑排序的题如果不是正常排的话可以尝试一下把图反过来画，这也是一种思路。

下面是链式前向星的AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;

struct node
{
    int to, next;
}e[maxn << 1];
int head[maxn], in[maxn];
int path[maxn];
int n, m, d, cnt, X;
void init() {
    memset(head, -1, sizeof(head));
    memset(in, 0, sizeof(in));
    memset(path, 0, sizeof(path));
    cnt = X = 0;
}
void add (int from, int to) {
    e[++cnt].to = to;
    e[cnt].next = head[from];
    head[from] = cnt;
}
void topsort() {
    priority_queue <int, vector <int>, less <int> > q; //按字典序从大到小
    vector <int> ans;
    for (int i = 1; i <= n; i++) {
        if (!in[i]) q.push(i);
    }
    while (!q.empty()) {
        int u = q.top();
        q.pop();
        path[X++] = u;
        for (int i = head[u]; i != -1; i = e[i].next) {
            int v = e[i].to;
            in[v]--;
            if (!in[v]) q.push(v);
        }
    }
   if (X != n) cout << "Impossible!" << endl;  // 若有环则无法拓扑排序
   else {
        for (int i = X - 1; i >= 0; i--) cout << path[i] << " ";// 记得倒过来输出
        cout << endl;
   }
}

int main()
{
    cin >> d;
    while (d--) {
        init();
        cin >> n >> m;
        for (int i = 0; i < m; i++) {
            int ui, vi;
            cin >> ui >> vi;
            add (vi, ui);
            in[ui]++;
        }
        topsort();
    }
    return 0;
}