输入样例:
00100 6
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
输出样例:
68237 6 00100
00100 1 99999
99999 5 12309
12309 2 00000
00000 4 33218
33218 3 -1
#include<cstdio>
using namespace std;
const int N=1e6+5;
int dat[N],wh[N],nex[N],whh[N];
void print(int place,int data,int nexplace)
{
if(!place)
printf("00000 ");
else
printf("%05d ",place);
printf("%d ",data);
if(!nexplace)
printf("00000\n");
else if(nexplace==-1)
printf("-1\n");
else
printf("%05d\n",nexplace);
}
int main()
{
int fir,n;scanf("%d%d",&fir,&n);
while(n--)
{
int id;scanf("%d",&id);
scanf("%d%d",&dat[id],&nex[id]);
}
int dex=fir,cnt=0;
while(dex!=-1)
{
wh[++cnt]=dex;//初始链表有序化
dex=nex[dex];
}
int mid=cnt/2;
for(int i=1;i<=mid;i++)//先是找到前mid个
whh[i*2]=wh[i];
if(mid*2<cnt)
whh[cnt]=wh[mid+1];
for(int i=cnt;i>mid;i--)//找到后边的
whh[(cnt-i)*2+1]=wh[i];
for(int i=1;i<cnt;i++)//上一步就是将链表的每个节点排好序,whh[i]新链表 放低i个节点的地址
print(whh[i],dat[whh[i]],whh[i+1]);
print(whh[cnt],dat[whh[cnt]],-1);
}