#define _CRT_SECURE_NO_WARNINGS 1 
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define N 10000
int n1;//空閒分割槽的個數
int n2;//作業區的個數
struct kongxian
{
	int start;  //起址
	int end;    //結束
	int length;  //長度
}kongxian[N];
struct zuoye
{
	int start;  //起址
	int end;   //結束
	int length;  //長度
}zuoye[N];
int cmp1(const void *a, const void *b)
{
	return (*(struct kongxian *)a).start - (*(struct kongxian *)b).start;
}
int cmp2(const void *a, const void *b)
{
	return (*(struct zuoye *)a).start - (*(struct zuoye *)b).start;
}
void init()
{
	n1 = 1;  //初始時只有一個空閒區
	n2 = 0;  //初始沒有作業
	kongxian[0].start = 0;
	kongxian[0].end = 511;
	kongxian[0].length = 512;
}
void print1() //列印空閒分割槽
{
	int i;
	for (i = 0; i<n1; i++)
		printf("空閒分割槽ID:%d 起止:%d 結束:%d 長度:%d\n", i, kongxian[i].start, kongxian[i].end, kongxian[i].length);
}
void print2() //列印作業分割槽
{
	int i;
	for (i = 0; i<n2; i++)
		printf("作業分割槽ID：%d 起止:%d 結束:%d 長度:%d\n", i, zuoye[i].start, zuoye[i].end, zuoye[i].length);
}
int main()
{
	int i, j, t, len, flag, id;
	int front, middle, behind;
	int t1, t2;
	init();
	print1();
	printf("輸入1裝入新作業，輸入0回收作業，輸入-1結束\n");
	while (scanf("%d", &t) != EOF)
	{
		if (t == 1)  //裝入新作業
		{
			printf("請輸入作業的佔用空間的長度 ");
			scanf("%d", &len);
			flag = 0;
			for (i = 0; i<n1; i++)
			{
				if (kongxian[i].length >= len)  //首次適應演算法
				{
					flag = 1;
					break;
				}
			}
			if (!flag)
			{
				printf("記憶體分配失敗\n");
			}
			else
			{
				//將該作業加入作業區裡
				zuoye[n2].start = kongxian[i].start;
				zuoye[n2].end = zuoye[n2].start + len;
				zuoye[n2].length = len;
				n2++;  //作業數加1
				if (kongxian[i].length == len) //該分割槽全部用於分配，刪除該空閒分割槽
				{
					for (j = i; j<n1 - 1; j++)
					{
						kongxian[j].start = kongxian[j + 1].start;
						kongxian[j].end = kongxian[j + 1].end;
						kongxian[j].length = kongxian[j + 1].length;
					}
					n1--;
				}
				else  //該空閒分割槽部分用於分配，剩餘的留在空閒分割槽中
				{
					kongxian[i].start += len;
					kongxian[i].length -= len;
				}
			}
		}
		else if (t == 0)
		{
			printf("輸入要回收的作業ID ");
			scanf("%d", &id);
			front = middle = behind = 0;
			for (i = 0; i<n1; i++)
			{
				if (kongxian[i].start>zuoye[id].end)
					break;
				if (kongxian[i].end == zuoye[id].start)  //待回收的作業上面有空閒分割槽
				{
					front = 1;
					t1 = i;
				}
				if (kongxian[i].start == zuoye[id].end)  //待回收的作業下面有空閒分割槽
				{
					behind = 1;
					t2 = i;
				}
			}
			if (!front&&!behind)  //待回收的作業上下均沒有空閒分割槽
			{
				kongxian[n1].start = zuoye[id].start;
				kongxian[n1].end = zuoye[id].end;
				kongxian[n1].length = zuoye[id].length;
				n1++;  //空閒分割槽增加一個
				qsort(kongxian, n1, sizeof(struct kongxian), cmp1); //插入空閒分割槽後排序
				for (j = id; j<n2 - 1; j++)  //在作業分割槽中刪除該作業
				{
					zuoye[j].start = zuoye[j + 1].start;
					zuoye[j].end = zuoye[j + 1].end;
					zuoye[j].length = zuoye[j + 1].length;
				}
				n2--;
			}
			if (front &&behind)  //待回收的作業上下均有空閒分割槽
				middle = 1;
			if (front&&!middle)  //合併待回收的作業和上面的空閒分割槽
			{
				kongxian[t1].end += zuoye[id].length;
				kongxian[t1].length += zuoye[id].length;
				for (j = id; j<n2 - 1; j++)  //在作業分割槽中刪除該作業
				{
					zuoye[j].start = zuoye[j + 1].start;
					zuoye[j].end = zuoye[j + 1].end;
					zuoye[j].length = zuoye[j + 1].length;
				}
				n2--;
			}
			if (middle)  //合併待回收的作業和上下的空閒分割槽
			{
				kongxian[t1].end = kongxian[t2].end;
				kongxian[t1].length += (zuoye[id].length + kongxian[t2].length);
				//刪除空閒分割槽t2
				for (j = t2; j<n1 - 1; j++)
				{
					kongxian[j].start = kongxian[j + 1].start;
					kongxian[j].end = kongxian[j + 1].end;
					kongxian[j].length = kongxian[j + 1].length;
				}
				n1--;
				for (j = id; j<n2 - 1; j++)  //在作業分割槽中刪除該作業
				{
					zuoye[j].start = zuoye[j + 1].start;
					zuoye[j].end = zuoye[j + 1].end;
					zuoye[j].length = zuoye[j + 1].length;
				}
				n2--;
			}
			if (behind &&!middle) //合併待回收的作業和下面的分割槽
			{
				kongxian[t2].start -= zuoye[id].length;
				kongxian[t2].length += zuoye[id].length;
				for (j = id; j<n2 - 1; j++)  //在作業分割槽中刪除該作業
				{
					zuoye[j].start = zuoye[j + 1].start;
					zuoye[j].end = zuoye[j + 1].end;
					zuoye[j].length = zuoye[j + 1].length;
				}
				n2--;
			}
		}
		else
		{
			printf("操作結束\n");
			break;
		}
		print1();
		print2();
	}
	return 0;
}