01背包问题（用c语言实现）-回溯法求解（剪枝）

网上的01背包回溯太乱啦，找到一个没剪枝的，我剪了枝发出来。
没剪枝的原文链接在这里

01背包问题（用c语言实现）-回溯法求解

#include 
#define max 100

int weight[max];
int value[max];
int n, max_weight, max_value;
int best_answer[max], answer[max];

void print()
{
    int i, j, k, l;
    printf("max_value%d\n", max_value);
    for (i = 1; i <= n; i++)
        printf("%d ", best_answer[i]);
    printf("\n");
}

void DFS(int level, int current_weight, int current_value)
{
    if (level >= n + 1)
    {
        if (current_value > max_value)
        {
            int i;
            max_value = current_value;
            for (i = 1; i <= n; i++)
                best_answer[i] = answer[i];
        }
    }
    else
    {
        if (current_weight < 0)
            return;
        int max_tmp = current_value;
        for (int i = level + 1; i <= n; i++)
            max_tmp += value[i];
        if (max_value > max_tmp)
            return;
        if (current_weight >= weight[level + 1])
        {
            current_weight = current_weight - weight[level + 1];
            current_value = current_value + value[level + 1];
            answer[level + 1] = 1;
            DFS(level + 1, current_weight, current_value);
            answer[level + 1] = 0;
            current_weight = current_weight + weight[level + 1];
            current_value = current_value - value[level + 1];
        }
        DFS(level + 1, current_weight, current_value);
    }
}

void init()
{
    int i, j, k, l;
    max_value = 0;
    for (i = 1; i <= n; i++)
        answer[i] = 0;
}

int main()
{
    int i, j, k, l;
    while (scanf("%d%d", &n, &max_weight) != EOF)
    {
        for (i = 1; i <= n; i++)
            scanf("%d", &weight[i]);
        for (j = 1; j <= n; j++)
            scanf("%d", &value[j]);
        init();
        DFS(0, max_weight, 0);
        print();
    }
    return 0;
}

/*
3 30
16 15 15
45 25 25
*/