思路
vector
1. push_back()
2. resize()
move a onto b : 把 a -> b 上面, 先把a, b上的块(block)移回原来的堆(pile)
move a over b : 把 a -> b堆 上面, 先把a上的块移回原来的堆
pile a onto b : 把 a堆 -> b 上面, 先把b上的块移回原来的堆
pile a over b : 把 a堆 -> b堆 上面
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 30;
vector<int> pile[N];
int n;
void find_block(int a, int &p, int &h)
{
for(p = 0; p < n; p ++ )
for(h = 0; h < pile[p].size(); h ++ )
if(pile[p][h] == a)
return ;
}
void clear_block(int p, int h)
{
for(int i = h + 1; i < pile[p].size(); i ++ )
pile[pile[p][i]].push_back(pile[p][i]);
pile[p].resize(h + 1);
}
void pile_into(int p, int h, int pp)
{
for(int i = h; i < pile[p].size(); i ++ )
pile[pp].push_back(pile[p][i]);
pile[p].resize(h);
}
int main()
{
cin >> n;
for(int i = 0; i < n; i ++ )
pile[i].push_back(i);
string sa, sb;
int a, b;
while(cin >> sa)
{
if(sa == "quit") break;
cin >> a >> sb >> b;
int pa, pb, ha, hb;
find_block(a, pa, ha);
find_block(b, pb, hb);
if(pa == pb) continue;
if(sa == "move")
clear_block(pa, ha);
if(sb == "onto")
clear_block(pb, hb);
pile_into(pa, ha, pb);
}
for(int i = 0; i < n; i ++ )
{
cout << i << ":";
for(int j = 0; j < pile[i].size(); j ++ )
cout << " " << pile[i][j];
cout << endl;
}
return 0;
}