uva 101

最新推荐文章于 2024-02-26 12:33:46 发布

原创最新推荐文章于 2024-02-26 12:33:46 发布 · 417 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 2 个专栏收录

84 篇文章

订阅专栏

杂题

10 篇文章

订阅专栏

本文介绍了一个使用C++实现的栈操作与块移动算法，该算法通过初始化位置数组和栈数组来管理元素的位置和堆叠关系。通过对输入指令的解析，实现了不同栈之间的元素移动，并确保了最终每个栈的状态正确输出。

#include <iostream>
#include <stdlib.h>
#include <stdio.h>

using namespace std;

const int maxn = 25 + 10;
int place[maxn];
int stack[maxn][maxn];
int top[maxn];
int number;

char oper[maxn], prep[maxn];
int a, b;

void init_place(int n)
{
	int posi = place[n];
	while (stack[posi][top[posi]] != n)
	{
		int temp = stack[posi][top[posi]];
		stack[temp][++top[temp]] = temp;
		place[temp] = temp;

		top[posi]--;
	}
}


void block_move(int a, int b)
{
	int posi = place[a];
	int posi_b = place[b];
	int index = top[posi];

	while (index >= 0 && stack[posi][index] != a)
		index--;

	for (int i = index; i <= top[posi]; i++)
	{
		stack[posi_b][++top[posi_b]] = stack[posi][i];
		place[stack[posi][i]] = posi_b;
	}
	top[posi] = index - 1;
}

int main()
{
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	cin >> number;
	for (int i = 0; i < number; i++)
	{
		place[i] = i;
		stack[i][0] = i;
		top[i] = 0;
	}

	while (scanf("%s", oper))
	{
		if ('q' == oper[0])
			break;
		scanf("%d%s%d", &a, prep, &b);
		
		if (place[a] == place[b])
			continue;
		if ('m' == oper[0])
			init_place(a);
		if ('n' == prep[1])
			init_place(b);

		block_move(a, b);
	}
	for (int i = 0; i < number; i++)
	{
		cout << i << ":";
		if (top[i] < 0)
		{
			cout << endl;
			continue;
		}

		for (int j = 0; j <= top[i]; j++)
			cout << " " << stack[i][j];
		cout << endl;
	}//for int i
	return 0;
}