回溯法求装载问题

/*
问题：装载问题：
方法：回溯法
建立二叉树，递归求解
*/
#include<stdio.h>
int max_load = 0;//当前最大装载量
int max_loading[20] = { 0 };//当前最优装载方案
void Maximum_load(int level, int* weight, int number, int current_weight, int limit_weight, int* load_seq, int residual_weight)
{
	if (level == number)
	{
		if (current_weight > max_load)
		{
			max_load = current_weight;
			for (int i = 0; i < number; i++)
			{
				max_loading[i] = load_seq[i];
			}
		}
		return;
	}
	residual_weight -= weight[level];
	if (current_weight + weight[level] <= limit_weight)
	{
		load_seq[level] = 1;
		current_weight += weight[level];
		Maximum_load(level + 1, weight, number, current_weight, limit_weight, load_seq, residual_weight);
		current_weight -= weight[level];//回溯
		load_seq[level] = 0;
	}
	if (current_weight+residual_weight>=limit_weight)
	{
		load_seq[level] = 0;
		Maximum_load(level + 1, weight, number, current_weight, limit_weight, load_seq, residual_weight);
	}
	residual_weight += weight[level];//回溯
}
int main()
{
	int weight[] = { 90, 80, 70, 40, 30, 20, 12, 10 };
	int load_seq[] = { 0, 0, 0, 0, 0, 0, 0, 0 };//全部没有装载，
	int number = sizeof(weight) / sizeof(weight[0]);
	int level=0,limit_weight = 140, current_weight = 0;
	int residual_weight = 0;
	for (int i = 0; i < number; i++)
	{
		residual_weight += weight[i];
	}
	Maximum_load(level ,weight, number, current_weight, limit_weight,load_seq,residual_weight);
	//参数解释：level 当前层数 weight 重量数组，number 货物数量 
	//			current_load  当前装载量 limit_eight 额定数量。
	//			load_sep  当前装载方案   residual_weight 剩余物品重量
	printf("限定最大的装载量：%d\n", limit_weight);
	printf("物品的重量：\n");
	for (int i = 0; i < number; i++)
	{
		printf("%-3d", weight[i]);
	}
	printf("\n最优装载量：%d\n", max_load);
	printf("最优装载方案：\n");
	for (int i = 0; i < number; i++)
	{
		printf("%-3d",max_loading[i]);
	}
	puts("\n*(1:表示装载，0：表示部装载)");
	return 0;
}