本題要求在一個數組中實現兩個堆疊。

函式介面定義：

Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );

其中Tag是堆疊編號，取1或2；MaxSize堆疊陣列的規模；Stack結構定義如下：

typedef int Position;
struct SNode {
    ElementType *Data;
    Position Top1, Top2;
    int MaxSize;
};
typedef struct SNode *Stack;
 

注意：如果堆疊已滿，Push函式必須輸出“Stack Full”並且返回false；如果某堆疊是空的，則Pop函式必須輸出“Stack Tag Empty”（其中Tag是該堆疊的編號），並且返回ERROR。

裁判測試程式樣例：

#include <stdio.h>
#include <stdlib.h>

#define ERROR 1e8
typedef int ElementType;
typedef enum { push, pop, end } Operation;
typedef enum { false, true } bool;
typedef int Position;
struct SNode {
    ElementType *Data;
    Position Top1, Top2;
    int MaxSize;
};
typedef struct SNode *Stack;

Stack CreateStack( int MaxSize );
bool Push( Stack S, ElementType X, int Tag );
ElementType Pop( Stack S, int Tag );

Operation GetOp();  /* details omitted */
void PrintStack( Stack S, int Tag ); /* details omitted */

int main()
{
    int N, Tag, X;
    Stack S;
    int done = 0;

    scanf("%d", &N);
    S = CreateStack(N);
    while ( !done ) {
        switch( GetOp() ) {
        case push: 
            scanf("%d %d", &Tag, &X);
            if (!Push(S, X, Tag)) printf("Stack %d is Full!\n", Tag);
            break;
        case pop:
            scanf("%d", &Tag);
            X = Pop(S, Tag);
            if ( X==ERROR ) printf("Stack %d is Empty!\n", Tag);
            break;
        case end:
            PrintStack(S, 1);
            PrintStack(S, 2);
            done = 1;
            break;
        }
    }
    return 0;
}

/* 你的程式碼將被嵌在這裡 */
 

輸入樣例：

5
Push 1 1
Pop 2
Push 2 11
Push 1 2
Push 2 12
Pop 1
Push 2 13
Push 2 14
Push 1 3
Pop 2
End

輸出樣例：

Stack 2 Empty
Stack 2 is Empty!
Stack Full
Stack 1 is Full!
Pop from Stack 1: 1
Pop from Stack 2: 13 12 11

 1 Stack CreateStack( int MaxSize )
 2 {
 3     Stack stack=(Stack)malloc(sizeof(struct
 
 SNode));
 4     stack->Data=(int *)malloc(sizeof(ElementType)*MaxSize);
 5     stack->Top1=-1;
 6     stack->Top2=MaxSize;
 7     stack->MaxSize=MaxSize;
 8     return stack;
 9 }
10 
11 bool Push( Stack S, ElementType X, int Tag ){
12     if(S==NULL)
13         return false;
14     if(S->Top1+1 == S->Top2)
15         {printf("Stack Full\n");
16          return false;}
17     if(Tag==1)
18     {S->Data[++S->Top1] = X;//++x即x先+1後形成s【x】
19      return true;}
20     else{
21         S->Data[--S->Top2] = X;
22         return true;
23     }
24 }
25 ElementType Pop( Stack S, int Tag ){
26     if(S==NULL)
27         return false;
28         if(Tag==1){
29             if(S->Top1==-1)
30                 {printf("Stack %d Empty\n",Tag);
31     return ERROR;}
32              return S->Data[S->Top1--];//x--即先形成s【x】再-1
33         }
34            
35     else
36     {
37         if(S->Top2==S->MaxSize)
38                 {printf("Stack %d Empty\n",Tag);
39     return ERROR;}
40     }
41     return S->Data[S->Top2++];
42 }