sgu 202

---

$Dp$ 类似三个盘子玩法，
然后表示不会输出方案。。。
于是去膜拜大神的程序，被智商压制。。。

---

http://www.cnblogs.com/hzf-sbit/p/3903573.html

---

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
const int maxn = 70, maxm = 70, Nya = -1, INF = 0x3f3f3f3f;

int n, m, cnt;
int f[maxn][maxm], g[maxn][maxm];
int s[maxm][maxn], top[maxm];

void dfs(int bowl,int col,int fr,int to)
{   

    if(bowl == 1)
    {
         printf("move %d from %d to %d",s[fr][top[fr]],fr,to);
         if(top[to]) printf(" atop %d",s[to][top[to]]);  

         s[to][++top[to]] = s[fr][top[fr]];
         s[fr][top[fr]--] = 0, puts(""); 
    }
    else
    {
        int num = g[bowl][col], key = s[fr][top[fr]-num+1];

        for(int i = 1;i <= m; i++)  
            if(i != fr && i != to)
                if(!top[i] || s[i][top[i]] > key)  
                {  
                  dfs(num, col, fr, i);  
                  dfs(bowl-num, col-1, fr ,to);  
                  dfs(num, col, i, to);  

                  return;
                 }

        fprintf(stderr,"error!\n");        
    }
}

int main()
{
#ifndef ONLINE_JUDGE    
    freopen("sgu202.in","r",stdin);
    freopen("sgu202.out","w",stdout);
#endif  

    std::cin >> n >> m;

    memset(f,INF,sizeof(f));
    memset(g,-1,sizeof(g));

    for(int i = 2; i <= m; i++)
        f[1][i] = 1, g[1][i] = 0;

    for(int j = 3; j <= m; j++)
        for(int i = 2; i <= n; i++)
            for(int k = 1; k < i; k++)
                {
                    long long newrc = (long long)(f[k][j]<<1)+f[i-k][j-1];
                    if(f[i][j] > newrc) f[i][j] = newrc, g[i][j] = k;
                }

    std::cout << f[n][m] << std::endl;

    for(int i = n; i >= 1; i--) s[1][++top[1]] = i;

    dfs(n, m, 1, m);

#ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
#endif  
}