A1074 Reversing Linked List (25) 静态链表

#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn=1000001;
struct Node
{
	int ad;
	int data;
	int next;
}node[maxn];
int main()
{
   int ad,n,k;
   cin>>ad>>n>>k;
   vector<Node> ans,re;
   for (int i=0;i<n;i++)
   {
   	  int ad1,data,ad2;
   	  scanf("%d %d %d",&ad1,&data,&ad2);
   	  node[ad1].ad=ad1;
   	  node[ad1].data=data;
   	  node[ad1].next=ad2;
   }
   int p=ad;
   while(p!=-1)
   {
   	ans.push_back(node[p]);
   	p=node[p].next;
   }
   int size=ans.size();
   int i;
   for (i=0;i<(size-size%k);i=i+k)
   {
      for (int j=i+k-1;j>=i;j--)
      {
      	 re.push_back(ans[j]);
	  }
   }
   for (i;i<size;i++)
   {
   	re.push_back(ans[i]);
   }
   for (i=0;i<size;i++)
   {
   	if(i!=size-1)
   	{
   		printf("%05d %d %05d\n",re[i].ad,re[i].data,re[i+1].ad);
	}
	else
	{
		printf("%05d %d -1",re[i].ad,re[i].data);
	}
   }
}