PAT A1074 Reversing Linked List+静态链表order

1074 Reversing Linked List （25 分）

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>
#include <algorithm>

using namespace std;

const int maxn=100010;

struct Node{
    int add,data,next;
    int order;
}node[maxn];

bool cmp(Node x,Node y){
    return x.order<y.order;
}

int main()
{
    for(int i=0;i<maxn;i++)
        node[i].order=maxn;
    int p,n,k;
    scanf("%d%d%d",&p,&n,&k);
    int add;
    for(int i=0;i<n;i++){
        scanf("%d",&add);
        node[add].add=add;
        scanf("%d%d",&node[add].data,&node[add].next);
    }
    int counter=0;
    while(p!=-1){
        counter++;
        node[p].order=counter;
        p=node[p].next;
    }
    sort(node,node+maxn,cmp);
    n=counter;
    int groups=n/k;
    for(int i=0;i<groups;i++){
        for(int j=(i+1)*k-1;j>=i*k;j--){
            if(j==i*k){  //每组的第一个
                if(i==groups-1 && n-groups*k==0){   //是最后一组且无多余元素next是-1
                    printf("%05d %d -1\n",node[j].add,node[j].data);
                }else if(i==groups-1 && n-groups*k>0){ //是最后一组但有多余元素next是j+k
                    printf("%05d %d %05d\n",node[j].add,node[j].data,node[j+k].add);
                }else            //不是最后一组，说明还有下一组，next是j+2*k-1
                    printf("%05d %d %05d\n",node[j].add,node[j].data,node[j+2*k-1].add);
            }else{  //不是每组的第一个，next是j-1
                printf("%05d %d %05d\n",node[j].add,node[j].data,node[j-1].add);
            }
        }
    }  //还有多余元素，顺序输出
    if(n-groups*k>0){
        for(int j=groups*k;j<n;j++){
            if(node[j].next==-1)
                printf("%05d %d -1\n",node[j].add,node[j].data);
            else
                printf("%05d %d %05d\n",node[j].add,node[j].data,node[j].next);
        }
    }
    return 0;
}