UVa 101 (模拟) The Blocks Problem

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
using namespace std;

const int maxn = 30;
int n;
vector<int> pile[maxn];

void find_block(int a, int& p, int& h)
{
for(int i = 0; i < n; ++i)
for(int j = 0; j < pile[i].size(); ++j)
if(pile[i][j] == a)
{ p = i; h = j; }
}

void clear_block(int p, int h)
{//将第p堆高度为h的上方的木块归位
for(int i = h+1; i < pile[p].size(); ++i)
{
int k = pile[p][i];
pile[k].push_back(k);
}
pile[p].resize(h+1);
}

void move_onto(int pa, int h, int pb)
{//将pa堆高度为h及以上的木块摞到pb堆上
for(int i = h; i < pile[pa].size(); ++i)
pile[pb].push_back(pile[pa][i]);
pile[pa].resize(h);
}

int main()
{
//freopen("in.txt", "r", stdin);
int a, b;
scanf("%d", &n);
for(int i = 0; i < n; ++i) pile[i].push_back(i);
string s1, s2;
while(cin >> s1 >> a >> s2 >> b)
{
int pa, pb, ha, hb;
find_block(a, pa, ha);
find_block(b, pb, hb);
if(pa == pb) continue;
if(s2 == "onto") clear_block(pb, hb);
if(s1 == "move") clear_block(pa, ha);
move_onto(pa, ha, pb);
}
for(int i = 0; i < n; ++i)
{
printf("%d:", i);
for(int j = 0; j < pile[i].size(); ++j) printf(" %d", pile[i][j]);
printf("\n");
}

return 0;
}