1133 Splitting A Linked List (25 分)

Given a singly linked list, you are supposed to rearrange its elements so that all the negative values appear before all of the non-negatives, and all the values in [0, K] appear before all those greater than K. The order of the elements inside each class must not be changed. For example, given the list being 18→7→-4→0→5→-6→10→11→-2 and K being 10, you must output -4→-6→-2→7→0→5→10→18→11.

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 (≤10​3​​). 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 in [−10​5​​,10​5​​], and Next is the position of the next node. It is guaranteed that the list is not empty.

Output Specification:

For each case, output in order (from beginning to the end of the list) the resulting linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 9 10
23333 10 27777
00000 0 99999
00100 18 12309
68237 -6 23333
33218 -4 00000
48652 -2 -1
99999 5 68237
27777 11 48652
12309 7 33218

Sample Output:

33218 -4 68237
68237 -6 48652
48652 -2 12309
12309 7 00000
00000 0 99999
99999 5 23333
23333 10 00100
00100 18 27777
27777 11 -1

#include<iostream>
using namespace std;
struct NODE
{
	int key ;
	int next;
	bool flag;
}node[100000];
int main()
{
	int n1=0;
	int First,Range,N,temp;
	cin>>First>>N>>Range;
	for(int i=0;i<N;i++)
	{
		cin>>temp;
		cin>>node[temp].key>>node[temp].next;
		node[temp].	flag=false;
	}
	for(int i=First;i!=-1;i=node[i].next)
	{
		if(node[i].key<0&&node[i].flag==false)
		{	
			if(n1==0)
			printf("%05d %d ",i,node[i].key);
			else printf("%05d\n%05d %d ",i,i,node[i].key); 
			  n1++;
			node[i].flag=true;
		}
	}
	for(int i=First;i!=-1;i=node[i].next)
	{
		if(node[i].key>=0&&node[i].key<=Range&&	node[i].flag==false)
		{
			if(n1==0)
			printf("%05d %d ",i,node[i].key);
			else printf("%05d\n%05d %d ",i,i,node[i].key); 
			  n1++;
			node[i].flag=true;
		}
	}
	for(int i=First;i!=-1;i=node[i].next)
	{
		if(node[i].flag==false)
		{
			if(n1==0)
			printf("%05d %d ",i,node[i].key);
			else printf("%05d\n%05d %d ",i,i,node[i].key); 
			  n1++;
			node[i].flag=true;
		}	
	}

	cout<<-1; 
}