# 02-线性结构3 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:
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;
struct node
{
int date;
int next;
int order;
node()
{
order=10000000000;
}
};
const int maxn=100000;
node List[maxn];
bool cmp(node a,node b)
{
return a.order<b.order;
}
int main()
{
int startpos,nodeNum,K;
cin>>startpos>>nodeNum>>K;
int startNode=startpos;
for(int i=0;i<nodeNum;i++)
{
}
int order=1;
while(startNode!=-1)
{
List[startNode].order=order;
order++;
startNode=List[startNode].next;
}
order--;
sort(List,List+maxn,cmp);
int start;
for(int j=0;j<order/K;j++)
{
start=j*K;
int i;
for(i=start+K-1;i>start;i--)
{
}
if(j!=order/K-1)
{
}
else
{
if(order%K==0)
else
{
for(int last=(j+1)*K;last<order-1;last++)
{