列车调度(Train)

#include "stdio.h"
#include <string>
#include<iostream>
using namespace std;

int main()
{
	int m, n;
	scanf("%d %d", &n, &m);
	int* sequence = new int[n];
	for (int i = 0; i != n; ++i)
		sequence[i] = i+1;
	int* output = new int[2 * n];
	for (int i = 0; i != 2 * n; ++i);
	int* stack = new int[m];
	int* goal = new int[n];
	for (int i = 0; i != n; ++i)
		scanf("%d", &goal[i]);
	int indexgoal = 0;
	int indexinput = 0;
	int indexstack = -1;
	int indexoutput = 0;
	int Flag = 1;
	while (indexinput != n && indexgoal != n && indexstack != m)
	{
		if (goal[indexgoal] == sequence[indexinput])
		{
			++indexstack;
			output[indexoutput++] = 1;
			if (indexstack == m) { Flag = 0; break; }
			++indexgoal;
			++indexinput;
			--indexstack;
			output[indexoutput++] = 0;
		}
		else if (goal[indexgoal] < sequence[indexinput])
		{
			if (goal[indexgoal] == stack[indexstack])
			{
				output[indexoutput++] = 0;
				--indexstack;
				++indexgoal;
			}
			else
			{
				Flag = 0; break;
			}
		}
		else
		{
			++indexstack;
			output[indexoutput++] = 1;
			if (indexstack == m ) { Flag = 0; break;}
			stack[indexstack] = sequence[indexinput];
			++indexinput;
		}
	}
	while (indexstack != -1)
	{
		--indexstack;
		output[indexoutput++] = 0;
	}

	if (Flag == 1) { 
		for (int i = 0; i != 2 * n; ++i)
		{
			if (output[i] == 1)
				printf("push\n");
			else
				printf("pop\n");
		}

	}
	else
		printf("No\n");
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值