砝码称重 2

样例输出 Sample Output
2

双向搜索

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#define MAXN 35
using namespace std;
int n,m;
int a[MAXN];
int L,R;
int ans=0x7fffffff;
map<int,int> p;
//进行到了k，最少由c硬币总和为s 
void dfs1(int k,int s,int c)
{
	if(p.count(s)){
		if(p[s]>c)
		 p[s]=c;
	}
	else p[s]=c;
	for(int i=k;i<=L;i++)
	 if(s+a[i]<=m)
	  dfs1(i+1,s+a[i],c+1); 
	
}
void dfs2(int k,int s,int c){
	if(p.count(m-s))
	 ans=min(ans,p[m-s]+c);
	for(int i=k;i<=R;i++)
	 if(s+a[i]<=m)
	  dfs2(i+1,s+a[i],c+1);
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	 scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	L=n/2;R=n;
	dfs1(1,0,0);
	dfs2(L+1,0,0);
	printf("%d",ans);
	return 0; 
}