A long stick（深度搜索）

最新推荐文章于 2022-01-16 00:23:29 发布

piekey1994

最新推荐文章于 2022-01-16 00:23:29 发布

阅读量767

点赞数

分类专栏： ACM集训-dfs 文章标签： dfs 深度搜素

本文链接：https://blog.csdn.net/piekey1994/article/details/38445853

版权

ACM集训-dfs 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Judge Info

Memory Limit: 32768KB
Case Time Limit: 10000MS
Time Limit: 10000MS
Judger: Number Only Judger

Description

There are a lot of problems about sticks. Here is one. I have $N\,$ sticks each with some length of $Li(1 \leq Li \leq 1, 000, 000)$ . I want to use those sticks to make a longer stick with length longer than or equal to $B\,$ . Furthermore, I want the length of the stick as close to $B \,$ as possible.

Task

Now, it is your turn. I will tell you the length of those $N\,$ sticks, and $B\,$ . Your job is let me know the length of stick which I can have, according the rule above.

Input

The first line of input contains $T(1 \leq T \leq 100)$ ,the number of test cases. There are two lines for each test case. The first line contains two integer numbers $N(1 \leq N \leq 25)$ and $B( 1 \leq B \leq S, S \,is \,the \,sum \,of \,Li )$ . The second line contains $N \,$ integer numbers(the length of sticks I have already, $Li \,$ ).

Output

For each test case, print a line contains the solution.

Sample Input

Sample Output

14
14

用户输入两个数，第一个表示有几根火柴，第二个数是期望长度

接下来是n根火柴的长度，你要取其中几根接起来达到大于等于期望长度，输出最短的那个值

dfs所有组合，一旦发现相等立刻终止搜索，否则就一直求min值

#include<iostream>
using namespace std;
int sum;
bool v[25];
int B;
int stick[25];
int flag=0;
int n;
int minlen;
 
void dfs(int last)
{
	if(flag) return ;
	if(sum!=0)
	{
		if(sum==B)
		{
			flag=1;
			return;
		}
		if(sum>B)
		{
			if(minlen!=0)
			{
				if(sum-B<minlen)
				minlen=sum-B;
			}
			else
			minlen=sum-B;
			return;
		}
	}
	for(int i=0;i<n;i++)
	{
		if(v[i]==0&&i>last)
		{
			v[i]=1;
			sum+=stick[i];
			dfs(i);
			sum-=stick[i];
			v[i]=0;
		}
	}
} 
 
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		cin>>n>>B;
		for(int i=0;i<n;i++)
		cin>>stick[i];
		sum=0;
		for(int i=0;i<n;i++)
		v[i]=0;
		flag=0;
		minlen=0;
		dfs(-1);
		if(flag==1)
		{
			cout<<B<<endl;
			continue;
		}
		cout<<minlen+B<<endl;
	}
	return 0;
}