POJ1706 References

最新推荐文章于 2016-10-11 19:31:34 发布

smaracoon

最新推荐文章于 2016-10-11 19:31:34 发布

阅读量326

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构编程实验06

本文链接：https://blog.youkuaiyun.com/smaracoon/article/details/45113321

数据结构编程实验06 专栏收录该内容

3 篇文章

订阅专栏

该程序实现了一种对参考文献进行排序和转换的方法。首先，它读取输入的参考文献信息，然后使用快速排序算法对它们按照旧编号进行排序。在读取过程中，如果遇到新的参考文献，会为它们分配新的编号。最后，程序将按照新的编号输出参考文献。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//6_1_1:	References	参考文献的整理 POJ1706
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxl = 80 + 5;	//一行最长为80个字符
const int maxs = 240 + 10;	//参考文献不超过3行
const int maxr = 1000;		//参考文献最多设置1000条
struct reference
{
	char info[maxs];
	int old_num,new_num;
}ref[maxr];
bool isEmpty(char str[])
{
	int i = 0;
	while(str[i])	if(str[i ++] != ' ')	return false;
	return true;
}
void quick_sort(int st,int ed)			//快排算法
{
	int i = st,j = ed;
	reference temp;
	if(st < ed)
	{
		temp = ref[st];
		while(i != j)
		{
			while(j > i && ref[j].new_num >= temp.new_num)	j--;
			ref[i] = ref[j];
			while(i < j && ref[i].new_num <= temp.new_num)	i++;
			ref[j] = ref[i];
		}
		ref[i] = temp;
		quick_sort(st,i - 1);
		quick_sort(i + 1,ed);
	}
}
int main()
{
	char str[maxl],info[maxs];
	int i,j,old_num,ref_num = 0,ref_sort = 0,flag,len; 
	while(gets(str) != NULL)
	{
	//如果一直是空行就一直重新输入,如果输入了^Z即EOF，那么往下走
		while(isEmpty(str))	if(gets(str) == NULL)	break;
		if(isEmpty(str))	break;	//如果输入了^Z即EOF，那么就返回	
		if(str[0] == '[')
		{
			old_num = 0;
			i = 1;
			while(str[i] != ']')	old_num = old_num * 10 + (int)(str[i ++] - '0');
			memset(info,0,sizeof(info));
			do{
				strcat(info,str);
				strcat(info,"\n");
			}while(gets(str) != NULL && !isEmpty(str));
			flag = 0;
			for(i = 0;i < ref_num;i ++)
				if(ref[i].old_num == old_num)
				{
					flag = 1;
					break;
				}
			if(!flag)				//如果没找到，此时还不知道这条文献的新标号是多少
			{
				ref_num ++;		
				ref[i].new_num = 0;
				ref[i].old_num = old_num;
			}
			strcpy(ref[i].info,info);
		}
		else
		{
			do{
				i = 0;
				len = strlen(str);
				while(i < len)
				{
					if(str[i] == '[')
					{
						i ++;
						old_num = 0;
						while(str[i] != ']')	old_num = old_num * 10 + (int)(str[i++] - '0');
						flag = 0;
						for(j = 0;j < ref_num;j ++)
							if(ref[j].old_num == old_num)
							{
								flag = 1;
								break;
							}
						if(!flag)
						{
							j = ref_num ++;
							ref[j].new_num = ++ref_sort;
							ref[j].old_num = old_num;
						}
						else	if(ref[j].new_num == 0)	ref[j].new_num = ++ref_sort;
						printf("[%d]",ref[j].new_num);
						i++;				//还有一个']'没处理
					}
					else	putchar(str[i++]);
				}
				putchar('\n');
			}while(gets(str) != NULL && !isEmpty(str));
			putchar('\n');
		}	
	}
	quick_sort(0,ref_num - 1);
	for(i = 0;i < ref_num;i ++)
	{
		printf("[%d]",ref[i].new_num);
		j = 0;
		while(ref[i].info[j++] != ']');
		while(ref[i].info[j]) putchar(ref[i].info[j++]);
		printf("\n");
	}
	return 0;
}
/*测试结果：通过POJ1706检测
[5] Brownell, D, "Dynamic Reverse Address Resolution Protocol
    (DRARP)", Work in Progress.

The Reverse Address Resolution Protocol (RARP) [10] (through the
The Reverse Address Resolution Protocol (RARP) [1] (through the
extensions defined in the Dynamic RARP (DRARP) [5]) explicitly
extensions defined in the Dynamic RARP (DRARP) [2]) explicitly
addresses the problem of network address discovery, and includes an
addresses the problem of network address discovery, and includes an
automatic IP address assignment mechanism.
automatic IP address assignment mechanism.


[10] Finlayson, R., Mann, T., Mogul, J., and M. Theimer, "A Reverse
        Address Resolution Protocol", RFC 903, Stanford, June 1984.

[16] Postel, J., "Internet Control Message Protocol", STD 5, RFC 792,
        USC/Information Sciences Institute, September 1981.


The Trivial File Transfer Protocol (TFTP) [20] provides for transport
The Trivial File Transfer Protocol (TFTP) [3] provides for transport
of a boot image from a boot server.  The Internet Control Message
of a boot image from a boot server.  The Internet Control Message
Protocol (ICMP) [16] provides for informing hosts of additional routers
Protocol (ICMP) [4] provides for informing hosts of additional routers
via "ICMP redirect" messages.
via "ICMP redirect" messages.


[20] Sollins, K., "The TFTP Protocol (Revision 2)",  RFC 783, NIC,
     June 1981.

Works [10], [16] and [20] can be obtained via Internet.
Works [1], [4] and [3] can be obtained via Internet.


^Z
[1] Finlayson, R., Mann, T., Mogul, J., and M. Theimer, "A Reverse
        Address Resolution Protocol", RFC 903, Stanford, June 1984.

[2] Brownell, D, "Dynamic Reverse Address Resolution Protocol
    (DRARP)", Work in Progress.

[3] Sollins, K., "The TFTP Protocol (Revision 2)",  RFC 783, NIC,
     June 1981.

[4] Postel, J., "Internet Control Message Protocol", STD 5, RFC 792,
        USC/Information Sciences Institute, September 1981.

请按任意键继续. . .
*/