B -- POJ 1208 The Blocks Problem

参考：https://blog.csdn.net/yxz8102/article/details/53098575

https://www.cnblogs.com/tanjuntao/p/8678927.html

 #include <iostream>
 #include <cstdio>
 #include <vector>
 #define N 30
 using namespace std;
 int n,a,b;
 string s,sa;
 vector<int> v[N];
 void init()
 {
     int i;
     for (i=;i<N;i++)
     {
         v[i].clear();
         v[i].push_back(i);
     }
 }
 void test()
 {
     cout<<s<<a<<sa<<b<<endl;
 }
 bool judge(int& ba,int& bb,int& ha,int& hb)//判断输入合法性 ，地址传参
 {
     int i,j;
     for (i=;i<n;i++)
     {
         for (j=;j<v[i].size();j++)
         {
             if (v[i][j]==a)
             {
                 ba=i;
                 ha=j;
             }
             if (v[i][j]==b)
             {
                 bb=i;
                 hb=j;
             }
         }
     }
     if (ba==bb)
     {
         return true;
     }
     else
     {
         return false;
     }
 }
 void clear(int block,int high)
 {
     int i;
     for (i=high+;i<v[block].size();i++)
     {
         int t=v[block][i];
         v[t].push_back(t);
     }
     v[block].resize(high+);
 }
 void pile(int pba,int pbb,int pha,int phb)
 {
     int i;
     for (i=pha;i<v[pba].size();i++)
     {
         v[pbb].push_back(v[pba][i]);
     }
     v[pba].resize(pha);//重设长度会删除后面元素~
 }
 void show()
 {
     int i;
     for (i=;i<n;i++)
     {
         printf("%d:",i);
         for (int j=;j<v[i].size();j++)
         {
             printf(" %d",v[i][j]);//依据方便实用printf,cout!!!
         }
         printf("\n");
     }
 }
 int main()
 {
     while (scanf("%d",&n)!=EOF)
     {
         int i;
         init();
         while (cin>>s)
         {
             if (s=="quit")
             {
                 break;
             }
             cin>>a>>sa>>b;
             int ba,bb,ha,hb;//ba为a的堆，ha为a在堆的高度
             if (judge(ba,bb,ha,hb))//多用传参形式，少用全局变量！！!
             {
                 continue;
             }
             if (s=="move")
             {
                 clear(ba,ha);
             }
             if (sa=="onto")
             {
                 clear(bb,hb);
             }
             pile(ba,bb,ha,hb);
         }
         show();
     }

     return ;
 }