记录编号	239542	评测结果	AAAAAAAAAA
题目名称	监考老师	最终得分	100
用户昵称	AntiLeaf	是否通过	通过
代码语言	C++	运行时间	1.623 s
提交时间	2016-03-20 12:14:37	内存使用	0.29 MiB

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
template<typename T>
struct deque{
private:
	static const int maxn=1010;
	T a[maxn];
	int head,tail;
public:
	deque(){
		memset(a,0,sizeof(a));
		head=tail=0;
	}
	void clear(){
		deque();
	}
	int size(){
		return head>tail?tail-head+maxn:tail-head;
	}
	bool empty(){
		return head==tail;
	}
	void push_back(const T& n){
		a[tail++]=n;
		if(tail==maxn) tail=0;
	}
	T pop_front(){
		T n=a[head++];
		if(head==maxn)head=0;
		return n;
	}
	void push_front(const T& n){
		if(head==0)head=maxn+1;
		a[--head]=n;
	}
	T pop_back(){
		if(tail==0)tail=maxn+1;
		T n=a[--tail];
		return n;
	}
	T& front(){
		return a[head];
	}
	T& back(){
		if(tail==0)return a[maxn-1];
		return a[tail-1];
	}
	T& end(){
		return a[tail-1];
	}
	bool in(const int &n){
		for(int i=0;i<size();i++)if(a[head+i>=maxn?head+n-maxn:head+n]==n)return true;
		return false;
	}
	T& operator[](const int& n){
		if(head+n>=maxn)return a[head+n-maxn];
		return a[head+n];
	}
};
int n,num;
deque<int>q;
int main(){
#define COGS
#ifdef COGS
	freopen("smallblack.in","r",stdin);
	freopen("smallblack.out","w",stdout);
#endif
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&num);
		while(!q.empty()&&q.back()>=num)q.pop_back();
		if(q.empty())printf("0 ");
		else printf("%d ",q.back());
		q.push_back(num);
	}
	return 0;
}