A1052 Linked List Sorting (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];
bool cmp(Node a,Node b)
{
	return a.data<b.data;
}
int main()
{
	int n,ad;
	cin>>n>>ad;
	vector<Node> ans;
	for (int i=0;i<n;i++)
	{
		int ad1,ad2,data;
		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;
	}
	sort(ans.begin(),ans.end(),cmp);
	if(ans.size()==0)
	printf("%d -1\n",ans.size());
	else
	printf("%d %05d\n",ans.size(),ans[0].ad);
	for (int i=0;i<ans.size();i++)
	{
		if(i!=ans.size()-1)
		printf("%05d %d %05d\n",ans[i].ad,ans[i].data,ans[i+1].ad);
		else
		printf("%05d %d -1",ans[i].ad,ans[i].data);
	}	
}