ZOJ 3631 Watashi's BG(DFS)

普通的0/1背包超时.只能用搜索.

剪枝:

首先对价格从大到小排序

当前的和加上剩余的价格和如果小于等最优值,那么就剪掉,因为结果肯定小于等于最优值

#include <iostream>
#include <memory.h>
#include <functional>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=10000010;
int pri[32],tot,ans,m,n;
void dfs(int curi,int sum){
	if(sum>m)return;
	else if(sum>ans){
		ans=sum;
	}else if(curi>=n)return;
	int ssum=sum;
	for (int i=curi;i<n;++i){
		ssum+=pri[i];
	}
	if(ssum<=ans)return;
	dfs(curi+1,sum+pri[curi]);
	dfs(curi+1,sum);
}
int main(){
	while (scanf("%d%d",&n,&m)==2){
		tot=0;
		for (int i=0;i<n;++i){
			scanf("%d",&pri[i]);
			tot+=pri[i];
		}
		ans=0;
		sort(pri,pri+n,greater<int>());
		dfs(0,0);
		printf("%d\n",ans);
	}
	return 0;
}