拔河比赛求解
题解:
显然我们可以DFS一边,取出最优的情况,因为每一个人有两种状态即选和不选,所以分别进行搜索
代码:
#include<bits/stdc++.h>
using namespace std;
int t,n,a[10005],sum,ans;
void dfs(int num_a,int num_c,int num_w){
if(n/2==num_c){
ans=min(ans,abs(num_w*2-sum));
return;
}
if(num_a>n) return;
dfs(num_a+1,num_c,num_w);
dfs(num_a+1,num_c+1,num_w+a[num_a]);
}
int main(){
scanf("%d",&t);
for(int i=1;i<=t;i++){
scanf("%d",&n);
sum=0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
ans=0x3f3f3f3f;
dfs(1,0,0);
printf("%d",ans);
}
return 0;
}