ZOJ 3631 Watashi's BG DFS

点击打开链接

思路:

本来是一个背包问题，背包容量太大，就T了
于是就只有DFS然后搜索，注意剪枝

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//
const int maxn = 1e5+10;

int n,M,cost[35];
int ans;

bool cmp(int x,int y){
	return x > y;
}

void dfs(int tot,int s){
	if(ans == M) return ;
	if(s > M) return ;
	if(tot>n){
		ans = max(s,ans);
		return ;
	}

	int sum = s;
	for(int i=tot; i<=n; i++)
		sum += cost[i];
	if(sum < ans) return ;

	dfs(tot+1,s+cost[tot]);
	dfs(tot+1,s);
}

int main(){
	while(scanf("%d%d",&n,&M)==2){
		ans = 0;
		for(int i=1; i<=n; i++)
			cost[i] = read();
		sort(cost+1,cost+1+n,cmp);

		dfs(0,0);
		cout << ans << endl;
	}

    return 0;
}

代码二：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//
const int maxn = 1e5+10;

int n,M,cost[35],vis[35];
int ans;

bool cmp(int x,int y){
	return x > y;
}

void dfs(int tot,int v){
	if(ans == M) return ;
	if(v > M) return ;
	if(v == M){
		ans = v;
		return ;
	}
	int sum=v;
    for(int j=tot+1;j<=n;j++){
        if(!vis[j])
            sum+=cost[j];
    }
    if(sum <= ans) return;
    ans=max(ans,v);

	for(int j=tot+1;j<=n;j++)
    {
        if(vis[j])
            continue;
        vis[j]=1;
        dfs(j,v+cost[j]);
        vis[j]=0;
    }
}

int main(){
	while(scanf("%d%d",&n,&M)==2){
		mem(vis);
		ans = 0;
		for(int i=1; i<=n; i++)
			cost[i] = read();
		sort(cost+1,cost+1+n,cmp);

		for(int i=1;i<=n;i++){
            vis[i]=1;
            dfs(i,cost[i]);
            vis[i]=0;
        }
		cout << ans << endl;
	}

    return 0;
}