拔河比赛(dfs)

拔河比赛

解题思路

深搜
x考虑到第x个成员
sum已经选择了sum个人
ans体重和

AC代码

#include<algorithm>
#include<cstdio>
#include<cmath> 
using namespace std;
int n,s,answer,w[25];
void dfs(int x,int sum,int ans)//dfs
{
    
    
	if(sum==n/2)
	{
    
    
		answer=min(answer,abs(ans*2-s));
		return;
	}
	if(x>n)return;
	dfs(x+1,sum+1,ans+w[x]);
	dfs(x+1,sum,ans);
}
int main()
{
    
    
	int T;
	scanf("%d",&T);
	while(T--)
	{
    
    
		s=0;//清零
		scanf("%d",&n);
		for(int i=1;i<=n;i++)
	 	 scanf("%d",&w[i]),s+=w[i];
		answer=s;//初值
		dfs(1,0,0);
		printf("%d\n",answer); 
	}
	return 0;
}

谢谢

猜你喜欢

转载自blog.csdn.net/weixin_45524309/article/details/112388550
今日推荐