手写栈

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>


using namespace std;


const int N = 10010;


int data[N],front,next,maxinum;


void Queue();
int Push(int x);
int Pop();
int Max();
inline int read();
inline void write(int x);


int main(){
return 0;
}


inline int read(){
int X = 0,w = 1;
char ch = '0';
if(ch < '0' || ch > '9'){
if(ch == '-'){
w = -1;
}
ch = getchar();
}
if(ch >= '0' && ch <= '9'){
X = (X<<3) + (X<<1) + ch - '0';
ch = getchar();
}
return X*w;
}


inline void write(int x){
if(x < 0){
putchar('-');
x = -x;
}
if(x > 9){
write(x / 10);
}
putchar(x % 10 + '0');
}


void Queue(){
next = 0;
front = 0;
maxinum = -N;
memset(data,0,sizeof(data));
}


int Push(int x){
if((next + 1) % N == front){
return 0;
}
else{
data[next] = x;
next = (next + 1) % N;
return 1;
}
}


int Pop(){
if(next == front){
return 0;
}
else{
front = (front + 1) % N;
return 1;
}
}


int Max(){
    if(next == front)
         return -N;
    else{
          maxinum = -N;
          for(int i = front;i < next ;i = (i+1) % N){
              if(data[i] > maxinum)
                   maxinum = data[i];
          }
          return maxinum;
    }
}