zoukankan      html  css  js  c++  java
  • 队列,排队买饭

     1 /*这题的错误是和同学熬夜找出来的呃= =。。。*/
    2
    3 #include<stdio.h>
    4 #include<string.h>
    5 int main()
    6 {
    7 int front,rear,i,f,j,n,t,q[10000];
    8 char s[20];
    9 scanf("%d",&n);
    10 rear =0,front=0;
    11 for(i=0;i<n;i++)
    12 {
    13 rear=i;
    14 scanf("%d",&q[rear]);
    15 }
    16 scanf("%d",&n);
    17 for(i = 0; i < n; i++)
    18 {
    19 scanf("%s",s);
    20
    21 if(strcmp(s,"ASK") == 0)
    22 {
    23 scanf("%d",&f);
    24 printf("%d\n",q[front+f-1]);
    25 }
    26 else if (strcmp(s,"JOIN") == 0)
    27 {
    28 scanf("%d",&f);
    29 rear++;
    30 q[rear] = f;
    31 }
    32 else if(strcmp(s,"FINISH") == 0)
    33 {
    34 scanf("%d",&f);
    35 front=front+f;
    36
    37 }
    38 else if(strcmp(s,"LEAVE") == 0)
    39 {
    40 scanf("%d",&f);
    41 for(j = front + f -1;j >front;j--)
    42 {
    43 q[j]=q[j-1];
    44 }
    45 front++;
    46
    47 }
    48 else if(strcmp(s,"LENGTH") == 0)
    49 {
    50 printf("%d\n",rear-front+1);
    51 }
    52
    53 }
    54 }
  • 相关阅读:
    Windows7共享设置
    13-运算符
    13-数据类型转换
    06-移动web之flex布局
    09-sass
    08-less预处理器
    移动端必须掌握知识点
    11-JS变量
    10-响应式
    07-rem
  • 原文地址:https://www.cnblogs.com/0803yijia/p/2364048.html
Copyright © 2011-2022 走看看