USACO5.2.1 Milk Measuring(milk4)

排序后搜索即可

/*
ID: xsy97051
PROG: milk4
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int Q,P,ans,v[105],use[20010];
bool f[20010];

int pai(int a,int b)
{
	return a<b;
}

void judge()
{
	memset(f,0,sizeof(f));
	for (int i=1;i<=Q/v[use[1]];i++)
		f[i*v[use[1]]]=1;
	for (int i=2;i<=ans;i++)
		for (int j=v[use[i]];j<=Q;j++) //第一种牛奶桶至少用了一次
			f[j]=f[j] | f[j-v[use[i]]] ;
	if (f[Q])
	{
		cout<<ans;
		for(int i=1;i<=ans;i++) 
		cout<<' '<<v[use[i]];
		cout<<endl;
		exit(0);
	}
}

void dfs(int k)
{
	for(int i=use[k-1]+1;i<=P-ans+k;i++)
	{
		use[k]=i;
		if(k==ans)	
			judge();
		else 
			dfs(k+1);
	}
}

int main()
{	
	freopen("milk4.in","r",stdin);
	freopen("milk4.out","w",stdout);
 	cin>>Q>>P;
	for (int i=1;i<=P;i++) 
		cin>>v[i];
	sort(v+1,v+1+P,pai);

	for(ans=1;ans<=P;ans++) dfs(1);

	return 0;
}