动态规划:分拆成两个子问题,N个圆盘移动,可以分成两个小的圆盘堆,其中一个圆盘堆较大,另一个较小,较小的圆盘仍为四柱汉诺塔问题,较大的圆盘堆只能使用三个柱子,根据题目,由2^N-1的通项公式。
dp[n] = min(dp[i] * 2 + pow2(n-i) -1), for i = 0.....n-1
/*
PROG: 汉诺塔II
LANG: C++11
*/
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <climits>
#include <ctype.h>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <deque>
#include <set>
#include <map>
#include <iostream>
#include <fstream>
#include <algorithm>
#include <time.h>
using namespace std;
#define mst(a,b) memset(a,b,sizeof(a))
typedef long long ll;
const int N = 100010;
const ll MOD = 1000000007;
const int INF = 0x7fffffff;
int dp[100];
int power2(int n){
int ans = 1;
while(n--){
ans *= 2;
}
return ans;
}
int main()
{
int n, i, k, j, tmp;
dp[0] = 0;
dp[1] = 1;
for(i = 2; i <= 64; i++){
dp[i] = 9999999;
for(j = i-1; 2*dp[j] + power2(i-j) < 9999999 ; j--){
tmp = power2(i-j) + dp[j]*2 - 1;
dp[i] = min(dp[i], tmp);
}
}
while(scanf("%d",&n) != EOF){
cout << dp[n] << endl;
}
return 0;
}