> #include<iostream>
> using namespace std;
> 
> typedef struct node{
> 	int data;
> 	struct node *next;
> }*LinkedList;
> int k;
> 
> LinkedList l;
> 
> LinkedList InitList(int k)
>  {
> 	LinkedList head,p;
> 	head=(LinkedList)malloc(sizeof(node));
> 	head->next=head;
> 	head->data=1;
> 	for(int i=1;i<k;i++)
> 	{
> 		p=(LinkedList)malloc(sizeof(node));
> 		p->data=i+1;
> 		p->next=head->next;
> 		head->next=p;
> 		head=head->next;
> 	}
> 	return(head->next);
> }
> /*void DestroyList()
> {
> 	LinkedList p=l,q;
> 	while (p->next!=NULL)
> 	{
> 		q=p->next;
> 		p->next=p->next->next;
> 		delete q;
> 	}
> 	l = NULL;
> }*/
> int del(int i,int k)
> {
> 	LinkedList p=l,q;
> 	for(int num=2*k;num>k;num--)
> 	{
> 		for(int j=1;j<i-1;j++)
> 			p=p->next;
> 		if(p->next->data<=k)
> 		{
> 	//		DestroyList();
> 			return 1;
> 		}
> 		else 
> 		{
> 			q=p->next;
> 			p->next=p->next->next;
> 			p=p->next;
> 			free(q);
> 		}
> 	}
> 	return 0;
> }
> void main()
> {
> 	while(cin>>k&&k!=0)
> 	{
> 		for(int i=k+1;;i++)
> 		{
> 			l=InitList(2*k);
> 			if(del(i,k)==0)
> 				break;
> 		}
> 		cout<<i<<endl;
> 	}
> }

• Re:这题我只用了30k内存。只开一个15的数组就够了。 (7) IC0500510091 2005-11-21 16:52:44