[PAT甲] 1074.Reversing Linked List

Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.
Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10
​5
​​ ) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.
Then N lines follow, each describes a node in the format:
Address Data Next
where Address is the position of the node, Data is an integer, and Next is the position of the next node.
Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.
Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

---

#include <iostream>
int data[100010];
int Next[100010];
int list[100010];
int result[100010];
using namespace std;
int main() {
    int a0, num, len;
    int temp;
    cin>>a0>>num>>len;
    for(int i=0; i<num; ++i) {
        cin>>temp;
        cin>>data[temp];
        cin>>Next[temp];
    }
    int sum=0;
    while(a0!=-1) {
        list[sum++] = a0;
        a0 = Next[a0];
    }

    for(int i=0; i<sum; ++i) {
        result[i] = list[i];
    }

    for(int i=0; i<sum-sum%len; ++i) {
        //余数即为每个区间的0，1，2，3，而前面就是这个区间的偏移量；
        result[i] = list[i/len*len + len-1-i%len];
    }

    for (int i = 0; i < sum - 1; i++)
        printf("%05d %d %05d\n", result[i], data[result[i]], result[i + 1]);
    printf("%05d %d -1", result[sum - 1], data[result[sum - 1]]);
    return 0;
}

之前想尝试用map容器解决，可是还不如大数组来的方便，
考虑到：
如果输入的结点并不是链表中的呢？这个方法就很好的解决了这个问题；