uva540-小团体队列

#include<iostream>
#include<fstream>
#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
const int MAX_LEN = 1005;
queue<int> Q[MAX_LEN];
int where[MAX_LEN]; 
int team[1000000];
int front, rear;
void enqueue(int index)
{
    int i = where[team[index]];
    if(i == -1) { 
        rear = (rear+1)%MAX_LEN;
        i = rear;
    }
    Q[i].push(index);
    where[team[index]] = i;
}
void dequeue()
{
    int temp;
    temp = Q[(front+1)%MAX_LEN].front();
    cout << temp << endl;
    Q[(front+1)%MAX_LEN].pop();
    if(Q[(front+1)%MAX_LEN].empty()) { 
        where[team[temp]] = -1;
        front = (front+1)%MAX_LEN;
    }
}
void Print(int now)
{
    cout << "Scenario #" << now << endl;
}
int main()
{
    int t, now = 1;
    cin >> t;
    front = rear = MAX_LEN-1;
    while(t != 0) {
        memset(where, -1, sizeof(where));
        for(int i=0; i<t; i++) {
            int n;
            cin >> n;
            for(int j=0; j<n; j++) {
                int number;
                cin >> number;
                team[number] = i;
            }
        }
        char c;
        while(c=getchar()!=‘\n‘) ;
        Print(now);
        char s[20];
        gets(s);
        while(strstr(s, "STOP") == NULL) {
            if(strstr(s, "ENQUEUE") != NULL) {
                int index;
                sscanf(s, "ENQUEUE %d", &index);
                enqueue(index);
            }
            else dequeue();
            gets(s);
        }
        now++;
        cout << endl;
        cin >> t;
        for(int i=0; i<MAX_LEN; i++) while(!Q[i].empty()) Q[i].pop();
        front = rear = MAX_LEN-1;
    }
}