AcWing 1371. 货币系统
题意:
思路:
背包模型的变式。
AC
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4+10;
ll f[N];
const ll inf = 0x3f3f3f3f3f3f3f3f;
int main(){
int n, m;
cin>>n>>m;
//memset(f,-1, sizeof f);
f[0] = 0;
for(int i = 1; i <= n; i ++ ){
int v;
cin>>v;
//f[i] = 0;
if(v>m)continue;
f[v]++;
for(int i = v; i <= m; i ++ ){
f[i]+=f[i-v];
// f[i] = max(f[i-v]+1,f[i]);
}
}
cout<<f[m];
return 0;
}