#10021. 「一本通 1.3 例 4」Addition Chains

最新推荐文章于 2024-08-02 13:40:20 发布

FirstBd.

最新推荐文章于 2024-08-02 13:40:20 发布

阅读量91

点赞数 3

文章标签：深度优先算法

本文链接：https://blog.csdn.net/ipalg666/article/details/131036859

版权

每日一宏

#define 大法师 dfs

大法师万岁

题目

题目描述

已知一个数列 $a_0$ , $a_1$ … $a_m$ （其中 $a_0$ = 1 , $a_m$ = n , $a_0 \lt a_1 \lt a_2 \lt ... \lt a_{m-1} \lt a_m$ ）。对于每个 k，需要满足 $a_k=a_i+a_j$ （ $\leq i$ , $\leq k-1$ ，这里 i 与 j 可以相等）。
现给定 n 的值，要求 m 的最小值（并不要求输出），及这个数列每一项的值（可能存在多个数列，只输出任一个满足条件的就可以了）。

输入格式

多组数据，每行给定一个正整数 n 。
输入以 0 结束。

输出格式

对于每组数据，输出满足条件的长度最小的数列。

样例

输入

输出

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

思路

首先，要枚举这个序列可能的长度
从1开始，一直到能够使最后一个数是n
确定下来之后从1到这个长度输出数列
那么怎么查找呢？
我们知道，这个数列中， $a_1$ =1, $a_m$ =n,
对于任意k都有 $a_k=a_i+a_j$
如果是遍历一个数，看看它加进去后能否成立未免有些麻烦
我们不妨往数列中添加 $a_i+a_j$
这样所成的数列一定是符合题意的

代码详解

#include<bits/stdc++.h>
using namespace std;
int n,maxl;
int a[105];
bool dfs(int);
int main()
{
	cin>>n;
	while(n){//
		a[1]=1;//a[1]一定是1
		for(maxl=1;;maxl++){//枚举可能的长度
			if(dfs(2)){//从第二个数开始搜
				break;
			}
		}
		for(int i=1;i<=maxl;i++){//输出答案
			cout<<a[i]<<" ";
		}
		cout<<endl;
		cin>>n;
	}
	return 0;
}
bool dfs(int k){
	if(k>maxl){
		if(a[k-1]==n){//保证最后一个数是n
			return true;
		}
		return false;
	}
	for(int i=k-1;i>=1;i--){//为了更快的找出可以添加的数，我们可以倒着搜
		for(int j=k-1;j>=i;j--){//因为这样可以选择尽可能大的数
			int tmp=a[i]+a[j];
			if(tmp>a[k-1]){//保证添加的这个数比前一个数大
				a[k]=tmp;
				if(dfs(k+1)){//如果有答案随时return
					return true;
				}
			}
		}
	}
	return false;//没找到的话只能false掉
}

打表神力！！！！！！

#include<bits/stdc++.h>
using namespace std;
int n,a[105][15]={{0},{1},{1,2},{1,2,3},{1,2,4},{1,2,4,5},{1,2,4,6},{1,2,4,6,7},{1,2,4,8},{1,2,4,8,9},{1,2,4,8,10},{1,2,4,8,10,11},{1,2,4,8,12},{1,2,4,8,12,13},{1,2,4,8,12,14},{1,2,4,5,10,15},{1,2,4,8,16},{1,2,4,8,16,17},{1,2,4,8,16,18},{1,2,4,8,16,18,19},{1,2,4,8,16,20},{1,2,4,8,16,20,21},{1,2,4,8,16,20,22},{1,2,4,5,9,18,23},{1,2,4,8,16,24},{1,2,4,8,16,24,25},{1,2,4,8,16,24,26},{1,2,4,8,9,18,27},{1,2,4,8,16,24,28},{1,2,4,8,16,24,28,29},{1,2,4,8,10,20,30},{1,2,4,8,10,20,30,31},{1,2,4,8,16,32},{1,2,4,8,16,32,33},{1,2,4,8,16,32,34},{1,2,4,8,16,32,34,35},{1,2,4,8,16,32,36},{1,2,4,8,16,32,36,37},{1,2,4,8,16,32,36,38},{1,2,4,8,12,13,26,39},{1,2,4,8,16,32,40},{1,2,4,8,16,32,40,41},{1,2,4,8,16,32,40,42},{1,2,4,8,9,17,34,43},{1,2,4,8,16,32,40,44},{1,2,4,8,9,18,36,45},{1,2,4,8,10,18,36,46},{1,2,4,8,12,13,26,39,47},{1,2,4,8,16,32,48},{1,2,4,8,16,32,48,49},{1,2,4,8,16,32,48,50},{1,2,4,8,16,17,34,51},{1,2,4,8,16,32,48,52},{1,2,4,8,16,32,48,52,53},{1,2,4,8,16,18,36,54},{1,2,4,8,16,18,36,54,55},{1,2,4,8,16,32,48,56},{1,2,4,8,16,32,48,56,57},{1,2,4,8,16,32,48,56,58},{1,2,4,8,16,17,34,51,59},{1,2,4,8,16,20,40,60},{1,2,4,8,16,20,40,60,61},{1,2,4,8,16,20,40,60,62},{1,2,4,8,16,20,21,42,63},{1,2,4,8,16,32,64},{1,2,4,8,16,32,64,65},{1,2,4,8,16,32,64,66},{1,2,4,8,16,32,64,66,67},{1,2,4,8,16,32,64,68},{1,2,4,8,16,32,64,68,69},{1,2,4,8,16,32,64,68,70},{1,2,4,8,16,32,64,68,70,71},{1,2,4,8,16,32,64,72},{1,2,4,8,16,32,64,72,73},{1,2,4,8,16,32,64,72,74},{1,2,4,8,16,24,25,50,75},{1,2,4,8,16,32,64,72,76},{1,2,4,8,9,17,34,68,77},{1,2,4,8,16,24,26,52,78},{1,2,4,8,16,24,26,52,78,79},{1,2,4,8,16,32,64,80},{1,2,4,8,16,32,64,80,81},{1,2,4,8,16,32,64,80,82},{1,2,4,8,16,17,33,66,83},{1,2,4,8,16,32,64,80,84},{1,2,4,8,16,17,34,68,85},{1,2,4,8,16,18,34,68,86},{1,2,4,8,16,24,28,29,58,87},{1,2,4,8,16,32,64,80,88},{1,2,4,8,16,32,64,80,88,89},{1,2,4,8,16,18,36,72,90},{1,2,4,8,16,24,25,50,75,91},{1,2,4,8,16,20,36,72,92},{1,2,4,8,16,20,36,72,92,93},{1,2,4,8,16,24,26,52,78,94},{1,2,4,8,16,20,21,37,74,95},{1,2,4,8,16,32,64,96},{1,2,4,8,16,32,64,96,97},{1,2,4,8,16,32,64,96,98},{1,2,4,8,16,32,33,66,99},{1,2,4,8,16,32,64,96,100}};
int main()
{
	cin>>n;
	while(n){
		int i=1;
		cout<<1<<" ";
		while(a[n][i]){
			cout<<a[n][i]<<" ";
			i++;
		}
		cout<<endl;
		cin>>n;
	}
	return 0;
}