野生版
采用的方法是体积不超过v(而不是恰好为v)
很像之前的最短路计数。所以,觉得这个目前比较好理解。
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1e3 + 10, mod = 1e9 + 7;
int v[N],w[N];
int n,m;
int f[N];
int g[N];
int main(){
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++){
scanf("%d%d",&v[i],&w[i]);
}
for(int i = 0; i <= m; i++)
g[i] = 1;
for(int i = 1; i <= n; i++){
for(int j = m; j >= v[i]; j--){
if(f[j] < f[j - v[i]] + w[i]){
g[j] = g[j -v[i]] % mod;
f[j] = f[j - v[i]] + w[i];
}
else if(f[j] == f[j - v[i]] + w[i]){
g[j] = (g[j] + g[j - v[i]]) % mod;
}
}
}
cout << g[m] << endl;
//int ans = 0;
// for(int i = 1; i <= m; i++){
// ans = max(ans,g[i]);
// }
// cout << ans << endl;
return 0;
}
y总版
y总是体积恰好为v.
#include <cstring>
#include <iostream>
using namespace std;
const int N = 1010, mod = 1e9 + 7;
int n, m;
int f[N], g[N];
int main()
{
cin >> n >> m;
memset(f, -0x3f, sizeof f);
f[0] = 0;
g[0] = 1;
for (int i = 0; i < n; i ++ )
{
int v, w;
cin >> v >> w;
for (int j = m; j >= v; j -- )
{
int maxv = max(f[j], f[j - v] + w);
int s = 0;
if (f[j] == maxv) s = g[j];
if (f[j - v] + w == maxv) s = (s + g[j - v]) % mod;
f[j] = maxv, g[j] = s;
}
}
//下面开始,不太理解了
int res = 0;
for (int i = 1; i <= m; i ++ )
if (f[i] > f[res])
res = i;
int sum = 0;
for (int i = 0; i <= m; i ++ )
if (f[i] == f[res])
sum = (sum + g[i]) % mod;
cout << sum << endl;
return 0;
}