poj 1208 The Blocks Problem 模拟+vector的使用

//poj 1208
//sep9
#include <iostream>
#include <vector>
using namespace std;
const int maxN=32;
vector<int> v[maxN],tmp;
char a[32],b[32];
int n,x,y,a1,a2,b1,b2;
void get_address()
{
	int i,j;
	for(i=0;i<n;++i)
		for(j=0;j<v[i].size();++j)
			if(v[i][j]==x){
				a1=i;
				b1=j;
			}
	for(i=0;i<n;++i)
		for(j=0;j<v[i].size();++j)
			if(v[i][j]==y){
				a2=i;
				b2=j;
			}
}

void show()
{
	int i,j;
	for(i=0;i<n;++i){
		printf("%d:",i);
			for(j=0;j<v[i].size();++j)
				printf("% d",v[i][j]);		
			printf("\n");
		}	
}

void a_move_back()
{
	int i;
	tmp.clear();
	for(i=b1+1;i<v[a1].size();++i)
		tmp.push_back(v[a1][i]);
	v[a1].erase(v[a1].begin()+b1+1,v[a1].end());
	for(i=0;i<tmp.size();++i){
		int x=tmp[i];
		v[x].insert(v[x].begin(),x);
	}	
}

void b_move_back()
{
	int i;
	tmp.clear();
	for(i=b2+1;i<v[a2].size();++i)
		tmp.push_back(v[a2][i]);
	v[a2].erase(v[a2].begin()+b2+1,v[a2].end());
	for(i=0;i<tmp.size();++i){
		int x=tmp[i];
		v[x].insert(v[x].begin(),x);
	}	
}