UVA - 529 Addition Chains（迭代+dfs）

最新推荐文章于 2019-07-24 14:33:15 发布

HelloWorld10086

最新推荐文章于 2019-07-24 14:33:15 发布

阅读量905

点赞数

分类专栏：回溯文章标签： Uva 529 Addition Chains

本文链接：https://blog.csdn.net/HelloWorld10086/article/details/38758527

版权

回溯专栏收录该内容

36 篇文章 1 订阅

订阅专栏

Addition Chains

An addition chain for n is an integer sequence $<a_0, a_1, a_2, \dots, a_m>$ with the following four properties:

a₀ = 1
a_m = n
a₀<a₁<a₂<...<a_m-1<a_m
For each k ( $1 \le k \le m$ ) there exist two (not neccessarily different) integers i and j ( $0 \le i, j \le k-1$ ) with a_k =a_i +a_j

You are given an integer n. Your job is to construct an addition chain for n with minimal length. If there is more than one such sequence, any one is acceptable.

For example, <1,2,3,5> and <1,2,4,5> are both valid solutions when you are asked for an addition chain for 5.

Input Specification

The input file will contain one or more test cases. Each test case consists of one line containing one integer n ( $1 \le n \le 10000$ ). Input is terminated by a value of zero (0) for n.

Output Specification

For each test case, print one line containing the required integer sequence. Separate the numbers by one blank.

Hint: The problem is a little time-critical, so use proper break conditions where necessary to reduce the search space.

Sample Input

Sample Output

1 2 4 5
1 2 4 6 7
1 2 4 8 12
1 2 4 5 10 15
1 2 4 8 9 17 34 68 77

题目大意：
给定一个数，按要求输出元素最少的序列。

a0 = 1
am = n
a0 < a1 < a2 < ... < am-1 < am
对于任意的1<=k<=m，都有ak = ai + aj

解题思路：
a[k] = a[k-1] + a[i] 0 <= i <= k-1
迭代加深搜索。限定搜索的深度k，然后开始进行DFS搜索，如果搜索完没有解，深度deep++，继续上诉搜索，直到找到可行解。

#include <stdio.h>
#include <string.h>
const int N = 100;
int deep;
int ans[N];
int n;
bool ok;
void dfs(int cur) {
	if(cur == deep) {
		if(ans[cur] == n) {
			ok = true;
		}
		return;
	}
	for(int i = 0; i <= cur; i++) {
		if(ans[cur] + ans[i] <= n) { //剪枝1
			int sum = ans[i] + ans[cur];

			for(int k = cur+1; k < deep; k++) { //剪枝2
				sum *= 2;
			}
			if(sum < n) { //如果当前最大的策略都小于n，则跳过
				continue;
			}
			
			ans[cur+1] = ans[i] + ans[cur];
			dfs(cur+1);
			if(ok) {
				return;
			}
		}
	}
}
int main() {
	while(scanf("%d",&n) != EOF && n) {
		memset(ans,0,sizeof(ans));
		ans[0] = 1;
		ok = false;
		
		//求出最短深度
		int sum = 1;
		deep = 0;
		while(sum < n) {
			sum *= 2;
			deep++;
		}
		//迭代
		while(true) {
			dfs(0);
			if(ok) {
				break;
			}
			deep++;
		}
		for(int i = 0; i < deep; i++) {
			printf("%d ",ans[i]);
		}
		printf("%d\n",ans[deep]);
	}
	return 0;
}