PATA1133_链表题（换汤不换药）

这种题就是模版struct node {}Node[];再根据要求输出就行。

#include <bits/stdc++.h>
using namespace std;
struct node {
    int data, next;
}Node[100000];
vector<int> neg, small, form, ans;
int main() {
    int n, k, fad, ad, data, next;
    cin >> fad >> n >> k;
    for (int i = 0; i < n; i++) {
        scanf ("%d %d %d", &ad, &data, &next);
        Node[ad].data = data, Node[ad].next = next;
    }
    while (fad != -1) {
        ad = fad, data = Node[ad].data;
        if (data < 0) neg.push_back(ad);
        else if (data >= 0 && data <= k) small.push_back(ad);
        else form.push_back(ad);
        fad = Node[ad].next;
    }
    for (auto it : neg) ans.push_back(it);
    for (auto it : small) ans.push_back(it);
    for (auto it : form) ans.push_back(it);
    for (int i = 0; i < ans.size(); i++) {
        if (i != ans.size() - 1) printf ("%05d %d %05d\n", ans[i], Node[ans[i]].data, ans[i + 1]);
        else printf ("%05d %d -1", ans[i], Node[ans[i]].data);
    }
}