打卡2.18

#include<stdio.h>
#include<string.h>
int main()
{
	unsigned long long t;
	scanf("%llu",&t);
	while(t--)
	{
		unsigned long long n,k=0,s[100005];
		scanf("%lld",&n);
		while(n--)
		{
			char a[10];
			scanf("%s",a);
			int len=strlen(a);
			if(a[0]=='p'&&a[1]=='u')
			{
				unsigned long long d;
				getchar();
				scanf("%llu",&d);
				k++;
				s[k]=d;
			}
			else if(a[0]=='p')
			{
				if(k==0)
				printf("Empty\n");
				else
				{
					s[k]='\0';
					k--;
				}
			}
			else if(a[0]=='q')
			{
				if(k==0)
				printf("Anguei!\n");
				else
				printf("%llu\n",s[k]);
			}
			else if(a[0]=='s')
			printf("%d\n",k);
		}
	}
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 3000005
stack<ll>q;
ll n,a[MAXN],f[MAXN];
int main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	f[n]=0;
	q.push(n); 
	for(int i=n-1;i>=1;i--){
		while(!q.empty()&&a[q.top()]<=a[i])
			q.pop();
		if(q.size()==0)
			f[i]=0;
		else 
			f[i]=q.top();
		q.push(i);
	}
	for(int i=1;i<=n;i++)
		printf("%d ",f[i]);
	return 0;
}