include stdio include stdlib struct DataElem int Elem int Max struct D

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include "stdio.h"
#include "stdlib.h"
struct DataElem
{
int Elem;
int Max;
};
struct Double
{
struct DataElem *data;
int cap;
int top1;
int top2;
};
void InitDubstack(struct Double *Dubstack,int n)
{
Dubstack->data=malloc(sizeof(struct DataElem)*n+sizeof(int*)*3);
Dubstack->cap=n;
Dubstack->top1=0;
Dubstack->top2=n-1;
}
void Enqueue(struct Double *Dubstack,long long Elem)
{
if(Dubstack->top1==0)
{
Dubstack->data[Dubstack->top1].Max=Elem;
}
else
{
if(Dubstack->data[Dubstack->top1-1].Max <= Elem)
{
Dubstack->data[Dubstack->top1].Max = Elem;
}
else
{
Dubstack->data[Dubstack->top1].Max = Dubstack->data[Dubstack->top1-1].Max;
}
}
Dubstack->data[Dubstack->top1].Elem=Elem;
Dubstack->top1+=1;
}
void Push(struct Double *Dubstack)
{
if(Dubstack->top2==Dubstack->cap-1)
{
Dubstack->data[Dubstack->top2].Max = Dubstack->data[Dubstack->top1].Elem;
}
else
{
if(Dubstack->data[Dubstack->top2+1].Max <= Dubstack->data[Dubstack->top1].Elem)
{
Dubstack->data[Dubstack->top2].Max = Dubstack->data[Dubstack->top1].Elem;
}
else Dubstack->data[Dubstack->top2].Max = Dubstack->data[Dubstack->top2+1].Max;
}
Dubstack->data[Dubstack->top2].Elem = Dubstack->data[Dubstack->top1].Elem;
Dubstack->top2-=1;
}
void Dequeue(struct Double *Dubstack)
{
if(Dubstack->top2==Dubstack->cap-1)
{
while(Dubstack->top1!=0)
{
Dubstack->top1-=1;
Push(Dubstack);
}
}
Dubstack->top2+=1;
printf("%d\n", Dubstack->data[Dubstack->top2].Elem);
}
void Max(struct Double *Dubstack)
{
if(Dubstack->top2!=Dubstack->cap-1)
{
if(Dubstack->top1==0)
printf("%d\n", Dubstack->data[Dubstack->top2+1].Max);
else
{
if(Dubstack->data[Dubstack->top1-1].Max > Dubstack->data[Dubstack->top2+1].Max)
{
printf("%d\n", Dubstack->data[Dubstack->top1-1].Max);
}
else
{
printf("%d\n", Dubstack->data[Dubstack->top2+1].Max);
}
}
}
else
{
printf("%d\n", Dubstack->data[Dubstack->top1-1].Max);
}
}
void Empt(struct Double *Dubstack)
{
if(Dubstack->top1==0 && Dubstack->top2==Dubstack->cap-1)
printf("true\n");
else
printf("false\n");
}
int main (int argc, char const *argv[])
{
char commands[6];
long long x;
int i,n;
struct Double Dubstack;
scanf("%d",&n );
InitDubstack(&Dubstack,n);
for(i = 0; i < n;i++)
{
scanf("%s", commands );
if(commands[1]=='N')
{
scanf("%lld",&x );
Enqueue(&Dubstack,x);
}
if(commands[0]=='M')
{
Max(&Dubstack);
}
if(commands[0]=='D')
{
Dequeue(&Dubstack);
}
if(commands[1]=='M')
{
Empt(&Dubstack);
}
}
free(Dubstack.data);
return 0;
}