洛谷UVA101——线性表

解法：

#include<iostream>
#include<vector>
#include<string>
#include<Windows.h>
using namespace std;

vector<int>block[30];
int n;		//木块总个数

void location(int b,int &block_place,int &block_height) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < block[i].size(); j++) {
			if (block[i][j] == b)	//找到所查询的木块
			{
				block_place = i;
				block_height = j;
			}
		}
	}
}
//将bp堆高度>bh的木块归位
void move_back(int bp, int bh) {

	for (int i = bh+1; i < block[bp].size(); i++) {	//移动所查询木块上方的木块
		int k = block[bp][i];
		block[k].push_back(k);
	}
	//删除移动后的木块----->从新指定容器大小
	block[bp].resize(bh+1);		//大小为木块所在高度+1，因为vector容器从0开始编号
}
  

//移动木块1堆上 >=bh1的所有木块到木块2上
void move_all(int bp1,int bh1,int bp2) {
		 
	for (int i = bh1; i < block[bp1].size(); i++) {
		int k = block[bp1][i];
		block[bp2].push_back(k);
	}
	block[bp1].resize(bh1);		//改变木块堆大小
}

 

void init() {
	cin >> n;
	for (int i = 0; i < n; i++)
		block[i].push_back(i);

}

void solve() {
	
	int	block1, block2;	//要移动的木块
	string op1, op2;	//要做的动作

	while (cin >> op1) {
		if (op1 == "quit")
			break;
		cin >> block1 >> op2 >> block2;
		int block1_place=0, block1_height=0;	//木块1的位置和高度
		int block2_place=0, block2_height=0;
		
		location(block1, block1_place, block1_height);//找到木块1
		//cout << "木块1的位置：" << block1_place << "  "<<block1_height<< endl;
		location(block2, block2_place, block2_height);//找到木块2
		//cout << "木块2的位置：" << block2_place << "  "<<block2_height<< endl;

		if (block1_place == block2_place)
			continue;
		//归位操作
		if (op1 == "move") {
			 move_back(block1_place, block1_height);		//将木块1以上的木块归位
		
		}
		//归位操作
		if (op2 == "onto") {	
			 move_back(block2_place, block2_height);		//将木块2以上的木块归位
		}
		//不归位，直接移动
		move_all(block1_place,block1_height,block2_place);
	}
}

void print() {
	for (int i = 0; i < n; i++) {
		cout << i << ":";
			for (int j = 0; j < block[i].size(); j++)
			{
				cout << " " << block[i][j];
			}
			cout << endl;
	}

}

int main() {
	
	

	init();
	solve();
	print();

	system("pause");
	return 0;
}