蒟蒻求助
  • 板块P1750 出栈序列
  • 楼主Giggs
  • 当前回复1
  • 已保存回复1
  • 发布时间2020/7/20 14:49
  • 上次更新2023/11/6 22:45:55
查看原帖
蒟蒻求助
85587
Giggs楼主2020/7/20 14:49
#include<bits/stdc++.h>
using namespace std;
stack<int> z1,z2,z3;
int a[10001];
int main()
{
	//freopen("string.in","r",stdin);
	//freopen("string.out","w",stdout);
	int n,c;
	cin>>n>>c;
	for(int i=1;i<=n;i++)
	{	
		cin>>a[i];
	}
	while(!z1.empty())
	{	
		
		for(int i=1;i<=c;i++)
		{
		//while(!z1.empty())
		//{z1.top()=z1.push(a[0]);
			if(z1.top()>a[i])
			{
				z2.push(z1.top()); 
				z1.pop();
				z1.push(a[i]);
			}
			else if(z1.top()<a[i])
					{
						if(z2.top()>a[i])
						{
							z1.push(a[i]);
						}
						else if(z2.top()<a[i])
								{
									z1.push(z2.top());
								}
					}
		//}
		}
		for(int i=1;i<=c;i++)
		{
			while(!z1.empty())
			{
				z3.push(z1.top());
			}
			cout<<z3.top();
			z3.pop();
		}
	}
	//fclose(stdin);
	//fclose(stdout);
	return 0;
}
2020/7/20 14:49
加载中...