P1441【DFS】【动态规划】砝码称重

先用深度优先搜索枚举情况，当被选择了n个节点并且m个被丢弃的时候，这时候进行dp判断是否满足最优，是否可以对答案进行更新。

here

// god with me
//#pragma GCC optimize(1)
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#include <cmath>
#include <math.h>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#define inf 0x7fffffff
#define ll long long
//#define int unsigned long long
#define int long long 
//#define double long double
//#define double long long
#define re int
//#define i int i
//#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define mk make_pair
//#define P pair < int , int >
// typedef long long s64;
using namespace std;
const int mod=1e6+7;
const int N=1e5+5;//?????????? 4e8
const int M=1e5+10;
const int maxn=32005;
int n,m;
int a[N];
int f[N];
bool tf[N];
int ans;

void godp()
{
	memset(f,0,sizeof(f));
	f[0]=true;
	int ret=0,tot=0;
//	for(int i=1;i<=n;i++)cout<<tf[i]<<" ";
//	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(tf[i])continue;
		for(int j=tot;j>=0;j--)if(f[j]&&!f[j+a[i]])f[j+a[i]]=true,ret++;
		tot+=a[i];
	}
	ans=max(ans,ret);
}


void dfs(int cur ,int now)
{
	if(cur>n||now>m)return;
	if(cur==n)
	{
		if(now==m)
		{
			godp();
		}
		return;	
	}
	dfs(cur+1,now);
	tf[cur+1]=true;
	dfs(cur+1,now+1);
	tf[cur+1]=false;
}

void solve()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	dfs(0,0);
	cout<<ans<<endl;
}


signed main()
{
//	ios::sync_with_stdio(false);
    int T=1;
//    cin>>T;
    for(int index=1;index<=T;index++)
    {
        solve();
    }
    return 0;
}