#include?
#include?
#include?
using?namespace?std;

/***?空閑鏈?***/
struct?Block{
????Block*?fro;?//?前向指針
????Block*?nex;?//?后向指針
????int?sta_add;?//?起始地址
????int?sz;?//?空閑塊大小
????bool?state;?//?分配狀態(tài)?1表示已經(jīng)分配?0表示空閑
????char?name[10];?//?占用分區(qū)作業(yè)名稱
}*block*first*p;?//?block:?分區(qū)塊遍歷變量?first:?分區(qū)首地址?p:?下一個開始遍歷的分區(qū)塊地址
int?n;?//?空閑塊數(shù)
/***?作業(yè)?***/
struct?Work{
????char?name[10];?//?作業(yè)名稱
????int?sz;?//?作業(yè)大小
????Block*?add;?//?分區(qū)塊的地址
????int?block_sz;?//?分區(qū)塊的大小
????bool?finish;?//?作業(yè)完成狀態(tài)?1表示已完成，0表示未完成
}work[100];
int?id?=?0;?//?作業(yè)數(shù)量

void?input（）{
????cout?<????cin?>>?n;
????Block*?fro;
????int?now?=?0;?//?起始地址
????for（int?i=0;?i????????cout?<????????int?sz;?cin?>>?sz;
????????block?=?new?Block（）;
????????block->state?=?0;
????????block->sz?=?sz;
????????block->sta_add?=?now;
????????now?=?now+sz;
????????strcpy（block->name“NULL“）;
????????if（i?==?0）?first?=?block;
????????else?block->fro?=?frofro->nex?=?block;
????????fro?=?block;
????}
????block->nex?=?first;
????p?=?first;
}

bool?allocation（int?id）{
????cout?<????char?name[10];?int?sz;
????cin?>>?name?>>?sz;
????block?=?p;
????for（int?t=0;?t????????if（block->state?==?1）?{?block?=?block->nex;?continue;}
????????if（block->sz?>=?sz）{
????????????cout?<????????????block->state?=?1;
????????????strcpy（block->namename）;
????????????work[id].block_sz?=?block->sz;
????????????strcpy（work[id].namename）;
????????????work[id].add?=?block;
????????????work[id].sz?=?sz;
????????????p?=?block->nex;
????????????return?1;
????????}
????????block?=?block->nex;
????}
????cout?<????return?0;
}

void?pback（）{
????cout?<????char?name[10];?cin?>>?name;
????bool?flag?=?0;
????for（int?i=0;?i????????if（strcmp（work[i].namename）==0?&&?work[i].finish==0）{
????????????block?=?work[i].add;
????????????strcpy（block->name“NULL“）;
????????????block->state?=?0;
????????????work[i].finish?=?1;
????????????flag?=?1;
????????????break;
????????}
????}
????if（flag?==?0）?{?cout<<“沒有該作業(yè)!\n“;?return?;}
????Block*?fro*?nex;
????nex?=?block->nex;
????if（block?==?first）{
????????if（n?==?1）?{
????????????cout?<????????????return?;
????????}
????????if（nex->state?==?0）{
????????????block->nex?=?nex->nex;
????????????nex->nex->fro?=?block;
????????????block->sz?=?block->sz+nex->sz;
????????????if（p?==?nex）?p?=?nex->nex;
????????????delete?nex;
????????}
????}else?if（block->nex?==?first）{
????????fro?=?block->fro;
????????if（fro->state?==?0）{
????????????fro->nex?=?block->nex;
????????????fro->sz?=?fro->sz+block->sz;
????????????if（p?==?block）?p?=?block->nex;
????????????delete?block;
????????}
????}else{
????????fro?=?block->fro;
????????nex?=?block->nex;
????????if（fro->state==0?&&?nex->state==0）{
????????????fro->nex?=?nex->nex;
???????????