挺簡單的一道模擬題，用來做stl或資料結構的練習題還是不錯的。注意的是這次用到了不止乙個佇列而是1000個，還有就是同乙個隊的要編號。
附上ac** time 30ms
#include#include#includeusing namespace std;
const int maxn=1000+10;
char order[10];
int main()
{ int num,ans,test=1;
while(scanf("%d",&num)==1 && num)
{int k;
ans=0;
mapm;
queuea;
queueb[maxn];
printf("scenario #%d\n",test++);
for(int i=0;i
#include#include#includeusing namespace std;
const int maxn=1000+10;
char order[10];
mapm;
queuea;
queueb[maxn];
int main()
{ int num,ans,test=1;
while(scanf("%d",&num)==1 && num)
{int k;
ans=0;
printf("scenario #%d\n",test++);
for(int i=0;i
UVA 540 團隊佇列
佇列練習題 用多個佇列來實現 乙個隊列為隊號佇列 將隊伍的編號入佇列 乙個佇列陣列為各個隊的佇列。不知道為什麼在poj上提交就超時，在uva上就不會超時。include include include include include include include include include i...
UVA540 團體佇列
有t個團隊的人正在排乙個長隊。每次新來乙個人時，如果他有隊友在排隊，那麼新人會插隊到最後乙個隊友的身後。如果沒有任何乙個隊友排隊，則他會被排到長隊的隊尾。輸入每個團隊中所有隊員的編號，要求支援如下3中指令 enqueue x 編號為x的人進入長隊 dequeue 長隊的隊首出隊 stop 停止模擬 ...
UVA 540 小團體佇列
這道題很有意思，一開始又想複雜了 include include include include include include include include include include include include include include include include inclu...