uva1374

题目描述：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=41552

/*
solution:
    迭代搜索+最优性剪枝，状态搜索。

date:2016/5/7
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n, numbers[10000], num_dex;

int maxval(int d) {
    int m = -1;
    for(int i = 0; i <= d; i++)
        if(numbers[i] > m)  m = numbers[i];
    return m;
}

bool dfs(int d, int maxd) {
    if(numbers[d] == n)                                 return true;
    if((maxval(d) << (maxd - d) < n) || d == maxd)      return false;

    for(int i = d; i >= 0; i--) {   //注意这是扩展下一层结点
        numbers[d + 1] = numbers[d] + numbers[i];
        if(dfs(d + 1, maxd))    return true;
        numbers[d + 1] = numbers[d] - numbers[i];
        if(dfs(d + 1, maxd))    return true;
    }
    return false;
}

int main()
{
    //freopen("input.txt", "r", stdin);
    while(~scanf("%d", &n) && n) {
        memset(numbers, 0, sizeof(numbers));
        numbers[0] = 1;
        int maxd;

        if(n == 1)  printf("0\n");
        else {
            for(maxd = 1; ; maxd++)
                if(dfs(0, maxd))    break;
            printf("%d\n", maxd);
        }
    }
    return 0;
}