Result: Accepted
Time: 3ms
Memory: 1120kB
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int n,m;
int s1=0;
scanf("%d%d",&n,&m);
getchar();
char str[51];
int s2[11];
for(int i=0;i<m;i++)
{
int num;
scanf("%s",str);
if(str[1]=='u')
scanf("%d",&num);
if(str[1]=='u')//塞入
{
if(s1>n-1)
printf("The queue is full\n");
else
{
s1++;
if(str[4]=='L')
{
printf("Pushed in left: %d\n",num);
if(s1==1)
s2[0]=num;
else
for(int k=s1-1;k>=0;--k)
{
s2[k]=s2[k-1];
}
s2[0]=num;
}
else
{
printf("Pushed in right: %d\n",num);
s2[s1-1]=num;
}
}
}
//
else if(str[1]=='o')//拿出
{
if(s1==0)
printf("The queue is empty\n");
else
{
s1--;
if(str[3]=='L')
{
printf("Popped from left: %d\n",s2[0]);
for(int k=1;k<=s1;k++)
s2[k-1]=s2[k];
}
else
{
printf("Popped from right: %d\n",s2[s1]);
s2[s1]=0;
}
}
}
}
return 0;
}